|
Article information
2003 , Volume 8, Special issue, p.87-100
Laevsky Y.M.
Some features of modern computational mathematics: problems and new generation of algorithms
Modern computational technology is based on a new generation of numerical methods and algorithms of solution of large-size problems of mathematical physics. Problems of approximation, iterative solution of linear systems, design of efficient preconditioners, solution of non-stationary problems are briefly reviewed in terms of the state-of-the-art.
Classificator Msc2000:- *65-02 Research exposition (monographs, survey articles)
- 65F10 Iterative methods for linear systems
- 65F35 Matrix norms, conditioning, scaling
- 65M55 Multigrid methods; domain decomposition
- 65N55 Multigrid methods; domain decomposition
Keywords: discretization, Dirichlet boundary condition, preconditioning, domain decomposition method, fictious domain method, multigrid method, multilevel method, survey paper, non-stationary problems
Author(s):
Laevsky Yu M
Dr. , Professor
Position: Head of Laboratory
Office: ICMMG SB RAS
Address: Russia, Novosibirsk
E-mail: laev@labchem.sscc.ru
Bibliography link:
Laevsky Y.M. Some features of modern computational mathematics: problems and new generation of algorithms // Computational technologies. 2003. V. 8. The Special Issue: Proceedings of the Russian-German Advanced Research Workshop on Computer Science and High Performance Computing, Part 2. P. 87-100
|
|
|
|
