Sparse matrix computations with application to solve system of nonlinear equations

被引:1
|
作者
Hossain, Shahadat [1 ]
Steihaug, Trond [2 ]
机构
[1] Univ Lethbridge, Dept Math & Comp Sci, Lethbridge, AB, Canada
[2] Univ Bergen, Dept Informat, Bergen, Norway
基金
加拿大自然科学与工程研究理事会;
关键词
optimization; Newton's method; sparse linear algebra; sparse matrix storage; Jacobian matrix;
D O I
10.1002/wics.1269
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Numerical linear algebra is an essential ingredient in algorithms for solving problems in optimization, nonlinear equations, and differential equations. Spanning diverse application areas, from economic planning to complex network analysis, modeling and solving problems arising in those areas share a common theme: numerical calculations on matrices that are sparse or structured or both. Linear algebraic calculations involving sparse matrices of order 109 are now routine. In this article, we give an overview of scientific calculations where effective utilization of properties such as sparsity, problem structure, etc. play a vital role and where the linear algebraic calculations are much more complex than their dense counterpart. This is partly because operation and storage involving known zeros must be avoided, and partly because the fact that modern computing hardware may not be amenable to the specialized techniques needed for sparse problems. We focus on sparse calculations arising in nonlinear equation solving using the Newton method. (C) 2013 Wiley Periodicals, Inc.
引用
收藏
页码:372 / 386
页数:15
相关论文
共 50 条