numerical linear algebra
numerical linear algebra A fundamentally important subject that deals with the theory and practice of processes in linear algebra. Principally these involve the central problems of the solution of linear algebraic equations Ax = b
and the eigenvalue problem in which eigenvalues λk and the eigenvectors xk are sought where Axk = λkxk
Numerical linear algebra forms the basis of much scientific computing. Both of these problems have many variants, determined by the properties of the matrix A. For example, a related problem is the solution of overdetermined systems where A has more rows than columns. Here there are good reasons for computing x to minimize the norm ||Ax – b||2
(see approximation theory).
A major activity is the computing of certain linear transformations in the form of matrices, which brings about some simplification of the given problem. Most widely used are orthogonal matrices Q, for which QT Q = I
(see identity matrix, transpose). An important feature of large-scale scientific computing is where the associated matrices are sparse, i.e. where a high proportion of the elements are zero (see sparse matrix). This is exploited in the algorithms for their solution.
There is now available high-quality software for an enormous variety of linear algebra processes.
and the eigenvalue problem in which eigenvalues λk and the eigenvectors xk are sought where Axk = λkxk
Numerical linear algebra forms the basis of much scientific computing. Both of these problems have many variants, determined by the properties of the matrix A. For example, a related problem is the solution of overdetermined systems where A has more rows than columns. Here there are good reasons for computing x to minimize the norm ||Ax – b||2
(see approximation theory).
A major activity is the computing of certain linear transformations in the form of matrices, which brings about some simplification of the given problem. Most widely used are orthogonal matrices Q, for which QT Q = I
(see identity matrix, transpose). An important feature of large-scale scientific computing is where the associated matrices are sparse, i.e. where a high proportion of the elements are zero (see sparse matrix). This is exploited in the algorithms for their solution.
There is now available high-quality software for an enormous variety of linear algebra processes.
More From encyclopedia.com
Algorithm , An algorithm is any well-defined procedure for solving a given class of problems. Ideally, when applied to a particular problem in that class, the al… linear programming , linear programming A technique in optimization, pioneered by George B. Dantzig, that is widely used in economic, military, and business-management de… Computer Science , The term Computer Science encompasses three different types of research areas: computability, efficiency, and methodology.
General Introduction
Compu… Allen Newell , Newell, Allen
NEWELL, ALLEN
(b. San Francisco, California, 19 March 1927, d. Pittsburgh, Pennsylvania, 19 July 1912)
Newell was a founder of artifici… Problem Solving , A managerial problem can be described as the gap between a given current state of affairs and a future desired state. Problem solving may then be tho… Computer Software Security , Computers are an important facet of forensic science . Individual computers as well as computers that are electronically connected via the Internet h…
You Might Also Like
NEARBY TERMS
numerical linear algebra