A branch of mathematics that studies the use of repeated discrete operations to find approximate solutions to continuous equations.
More information
More information
Subcategories 10
Related categories 1
Sites 6
Bergen, Norway. Information about the annual international Domain Decomposition meeting, links to people working in the field and information about books and other material related to Domain Decomposition.
A collection of resources on numerical methods aimed at undergraduates, maintained at the University of South Florida.
Tracking moving interfaces in computational geometry, materials sciences, robotics, image processing, and fluid mechanics; numerical techniques based on partial differential equations.
Newton's iteration : History, convergence results, Halley's iteration and high order new iterations. A web text in HTML and PostScript.
SIAM activity group. Newsletter, conferences, bibliography, reports, history, jobs, other resources.
Describing two major algorithms: one efficient in terms of size, the other in terms of speed. English/Portuguese.
Bergen, Norway. Information about the annual international Domain Decomposition meeting, links to people working in the field and information about books and other material related to Domain Decomposition.
A collection of resources on numerical methods aimed at undergraduates, maintained at the University of South Florida.
Newton's iteration : History, convergence results, Halley's iteration and high order new iterations. A web text in HTML and PostScript.
SIAM activity group. Newsletter, conferences, bibliography, reports, history, jobs, other resources.
Tracking moving interfaces in computational geometry, materials sciences, robotics, image processing, and fluid mechanics; numerical techniques based on partial differential equations.
Describing two major algorithms: one efficient in terms of size, the other in terms of speed. English/Portuguese.
Other languages 2
