The method of dynamic programming and internal parallels for approximate solution of the Dirichlet problem (Q1975096)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The method of dynamic programming and internal parallels for approximate solution of the Dirichlet problem |
scientific article; zbMATH DE number 1427848
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The method of dynamic programming and internal parallels for approximate solution of the Dirichlet problem |
scientific article; zbMATH DE number 1427848 |
Statements
The method of dynamic programming and internal parallels for approximate solution of the Dirichlet problem (English)
0 references
5 April 2000
0 references
It is presented the method of dynamic programming designed for minimization of a quadratic functional. It is implemented in conjunction with a special method of approximate solution of the Dirichlet problem employing the principles of dynamic programming, in wich the set of grid points obtained as a result of triangulation of the domain is divided into blocks. The boundary grid points are lumped together in a single block, which reduces the boundary value problem to a Cauchy problem.
0 references
boundary value problem
0 references
dynamic programming
0 references
minimization
0 references
quadratic functional
0 references
Dirichlet problem
0 references
Cauchy problem
0 references
0.88386303
0 references
0.8795615
0 references
0.8678727
0 references
0.8616123
0 references
0 references
0.8601985
0 references
