Numerical Linear Algebra: Theory and Applications

2017 ◽  
Author(s):  
Larisa Beilina ◽  
Evgenii Karchevskii ◽  
Mikhail Karchevskii
Keyword(s):  
Linear Algebra ◽  
Numerical Linear Algebra ◽  
Algebra Theory

scholarly journals Erratum to: Numerical Linear Algebra: Theory and Applications

2017 ◽  
pp. E1-E1
Author(s):  
Larisa Beilina ◽  
Evgenii Karchevskii ◽  
Mikhail Karchevskii
Keyword(s):  
Linear Algebra ◽  
Numerical Linear Algebra ◽  
Algebra Theory

scholarly journals Infinite-dimensional numerical linear algebra: theory and applications

2010 ◽  
Vol 466 (2124) ◽  
pp. 3539-3559 ◽  
Author(s):  
Anders C. Hansen
Keyword(s):  
Linear Algebra ◽  
Hilbert Spaces ◽  
Numerical Linear Algebra ◽  
New Method ◽  
Bounded Operators ◽  
Infinite Dimensional ◽  
The Core ◽  
Algebra Theory ◽  
Spectra And Pseudospectra

We present a new method for computing spectra and pseudospectra of bounded operators on separable Hilbert spaces. The core in this theory is a generalization of the pseudospectrum called the n -pseudospectrum.

scholarly journals Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices

2021 ◽  
Author(s):  
Stefano Massei
Keyword(s):  
Computer Science ◽  
Recent Work ◽  
Linear Algebra ◽  
Optimization Problems ◽  
Approximation Error ◽  
Positive Semidefinite ◽  
Numerical Linear Algebra ◽  
Maximum Volume ◽  
Deterministic Algorithms ◽  
Principal Submatrix

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 ) .

scholarly journals Numerical Linear Algebra in Signal Processing Applications

2007 ◽  
Vol 2007 (1) ◽  
Author(s):  
Nicola Mastronardi ◽  
Gene H Golub ◽  
Shivkumar Chandrasekaran ◽  
Marc Moonen ◽  
Paul Van Dooren ◽  
...  
Keyword(s):  
Signal Processing ◽  
Linear Algebra ◽  
Numerical Linear Algebra

Special Section on Iterative Methods in Numerical Linear Algebra

1994 ◽  
Vol 15 (3) ◽  
pp. 545-546
Author(s):  
Tom Manteuffel ◽  
Steve McCormick
Keyword(s):  
Iterative Methods ◽  
Linear Algebra ◽  
Special Section ◽  
Numerical Linear Algebra
Sign in / Sign up

Export Citation Format

Share Document