M-Matrix Theory and Recent Results in Numerical Linear Algebra

1976 ◽  
pp. 375-387 ◽  
Author(s):  
Richard S. Varga
2017 ◽  
Author(s):  
William Layton ◽  
Myron Sussman

This textbook was designed for senior undergraduates in mathematics, engineering and the sciences with diverse backgrounds and goals. It presents modern tools from numerical linear algebra with supporting theory along with examples and exercises, both theoretical and computational with MATLAB. The major topics of numerical linear algebra covered are direct methods for solving linear systems, iterative methods for large and sparse systems (including the conjugate gradient method) and eigenvalue problems. Basic linear algebra (of the type taken in the engineering curriculum) is assumed. Further matrix theory is developed in a self-contained way when needed to expalin why methods work and how they might fail. This book is intended for a one term course for undergraduate students in applied and computational mathematics, the sciences, engineering, computer science, financial mathematics and actuarial science. It is also a good choice for a beginning graduate level course for students who will use the numerical methods to solve problems in their own areas.


Author(s):  
Stefano Massei

AbstractVarious applications in numerical linear algebra and computer science are related to selecting the $$r\times r$$ r × r submatrix of maximum volume contained in a given matrix $$A\in \mathbb R^{n\times n}$$ A ∈ R n × n . We propose a new greedy algorithm of cost $$\mathcal O(n)$$ O ( n ) , for the case A symmetric positive semidefinite (SPSD) and we discuss its extension to related optimization problems such as the maximum ratio of volumes. In the second part of the paper we prove that any SPSD matrix admits a cross approximation built on a principal submatrix whose approximation error is bounded by $$(r+1)$$ ( r + 1 ) times the error of the best rank r approximation in the nuclear norm. In the spirit of recent work by Cortinovis and Kressner we derive some deterministic algorithms, which are capable to retrieve a quasi optimal cross approximation with cost $$\mathcal O(n^3)$$ O ( n 3 ) .


Author(s):  
Nicola Mastronardi ◽  
Gene H Golub ◽  
Shivkumar Chandrasekaran ◽  
Marc Moonen ◽  
Paul Van Dooren ◽  
...  

1953 ◽  
Vol 116 (4) ◽  
pp. 457
Author(s):  
K. D. Tocher ◽  
Robert R. Stoll
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document