default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Matrix Analysis and Applications, Volume 41
Volume 41, Number 1, 2020
- Yurii E. Nesterov, Vladimir Yu. Protasov
:
Computing Closest Stable Nonnegative Matrix. 1-28 - Sophie Hautphenne, Stefano Massei:
A Low-Rank Technique for Computing the Quasi-Stationary Distribution of Subcritical Galton-Watson Processes. 29-57 - Xiao Liu, Yuanzhe Xi, Yousef Saad, Maarten V. de Hoop:
Solving the Three-Dimensional High-frequency Helmholtz Equation Using Contour Integration and Polynomial Preconditioning. 58-82 - Luis García Ramos, René Kehl, Reinhard Nabben:
Projections, Deflation, and Multigrid for Nonsymmetric Matrices. 83-105 - Jaroslaw Buczynski, Elisa Postinghel, Filip Rupniewski:
On Strassen's Rank Additivity for Small Three-way Tensors. 106-133 - Volker Mehrmann, Paul Van Dooren:
Optimal Robustness of Port-Hamiltonian Systems. 134-151 - Florent Bouchard, Bijan Afsari, Jérôme Malick, Marco Congedo:
Approximate Joint Diagonalization with Riemannian Optimization on the General Linear Group. 152-170 - Estelle M. Massart, Pierre-Antoine Absil:
Quotient Geometry with Simple Geodesics for the Manifold of Fixed-Rank Positive-Semidefinite Matrices. 171-198 - Dmitry Batenkov, Laurent Demanet, Gil Goldman, Yosef Yomdin:
Conditioning of Partial Nonuniform Fourier Matrices with Clustered Nodes. 199-220 - Xin Xing, Edmond Chow:
Interpolative Decomposition via Proxy Points for Kernel Matrices. 221-243 - Yaqi Duan, Mengdi Wang, Zaiwen Wen, Yaxiang Yuan:
Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains. 244-278 - Yashar Zeinaly, Jan H. van Schuppen, Bart De Schutter:
Linear Positive Systems May Have a Reachable Subset from the Origin That is Either Polyhedral or Nonpolyhedral. 279-307 - Andrei A. Agrachev, Khazhgali Kozhasov, André Uschmajew:
Chebyshev Polynomials and Best Rank-one Approximation Ratio. 308-331 - Gilles Baechler, Frederike Dümbgen, Golnoosh Elhami, Miranda Krekovic, Martin Vetterli:
Coordinate Difference Matrices. 332-363
Volume 41, Number 2, 2020
- Steven Elsworth, Stefan Güttel:
The Block Rational Arnoldi Method. 365-388 - Martin S. Andersen, Tianshi Chen:
Smoothing Splines and Rank Structured Matrices: Revisiting the Spline Kernel. 389-412 - Larry Allen, Robert C. Kirby:
Structured Inversion of the Bernstein Mass Matrix. 413-431 - Yao-Lin Jiang, Kang-Li Xu:
Riemannian Modified Polak-Ribière-Polyak Conjugate Gradient Order Reduced Model by Tensor Techniques. 432-463 - Marie Kubínová, Kirk M. Soodhalter:
Admissible and Attainable Convergence Behavior of Block Arnoldi and GMRES. 464-486 - Peter Richtárik, Martin Takác:
Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory. 487-524 - Ximing Chen, Masaki Ogura, Victor M. Preciado:
Bounds on the Spectral Radius of Digraphs from Subgraph Counts. 525-553 - Pedro G. Massey, Demetrio Stojanoff, Sebastian Zarate:
Majorization Bounds for Ritz Values of Self-Adjoint Matrices. 554-572 - Timothy A. Davis, Iain S. Duff, Stojce Nakov:
Design and Implementation of a Parallel Markowitz Threshold Algorithm. 573-590 - Marina Bertolini, GianMario Besana, Gilberto Bini, Cristina Turrini:
The Rank of Trifocal Grassmann Tensors. 591-604 - Maolin Che, Yimin Wei, Hong Yan:
The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection. 605-636 - Tobias Damm, Heike Faßbender:
Simultaneous Hollowization, Joint Numerical Range, and Stabilization by Noise. 637-656 - Fredy Sosa, Julio Moro, Christian Mehl:
First Order Structure-Preserving Perturbation Theory for Eigenvalues of Symplectic Matrices. 657-690 - Dario A. Bini, Beatrice Meini, Jie Meng:
Solving Quadratic Matrix Equations Arising in Random Walks in the Quarter Plane. 691-714 - Léopold Cambier, Chao Chen, Erik G. Boman, Sivasankaran Rajamanickam, Raymond S. Tuminaro, Eric Darve:
An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations. 715-746 - Ignat Domanov, Lieven De Lathauwer:
On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-(1, Lr, Lr) Terms. 747-803 - Andreas Frommer, Kathryn Lund, Daniel B. Szyld:
Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM. 804-837 - Rui Li, Zeng-Qi Wang:
Restrictively Preconditioned Conjugate Gradient Method for a Series of Constantly Augmented Least Squares Problems. 838-851 - Johannes Brust, Roummel F. Marcia, Cosmin G. Petra:
Computationally Efficient Decompositions of Oblique Projection Matrices. 852-870 - Ben S. Southworth, Abdullah Ali Sivas, Sander Rhebergen:
On Fixed-Point, Krylov, and 2˟ 2 Block Preconditioners for Nonsymmetric Problems. 871-900 - Hongguo Xu:
A Core-Chasing Symplectic QR Algorithm. 901-927 - Nicat Aliyev, Peter Benner, Emre Mengi, Matthias Voigt:
A Subspace Framework for H∞-Norm Minimization. 928-956
Volume 41, Number 3, 2020
- Lei-Hong Zhang, Wei Hong Yang, Chungen Shen, Jiaqi Ying:
An Eigenvalue-Based Method for the Unbalanced Procrustes Problem. 957-983 - Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani:
Efficient Reduction of Compressed Unitary Plus Low Rank Matrices to Hessenberg Form. 984-1003 - Adrian S. Lewis, Michael L. Overton:
Partial Smoothness of the Numerical Radius at Matrices Whose Fields of Values are Disks. 1004-1032 - Fernando de Terán, Andrii Dmytryshyn, Froilán M. Dopico:
Generic Symmetric Matrix Polynomials with Bounded Rank and Fixed Odd Grade. 1033-1058 - Xin Ye, Jianlin Xia, Lexing Ying:
Analytical Low-Rank Compression via Proxy Point Selection. 1059-1085 - Oscar Mickelin, Sertac Karaman:
Multiresolution Low-rank Tensor Formats. 1086-1114 - Jiawang Nie, Zi Yang:
Hermitian Tensor Decompositions. 1115-1144 - Alexis Montoison, Dominique Orban:
BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property. 1145-1166 - Aleksandar Cvetkovic, Vladimir Yu. Protasov:
Maximal Acyclic Subgraphs and Closest Stable Matrices. 1167-1182 - Eric Hallman:
Sharp 2-Norm Error Bounds for LSQR and the Conjugate Gradient Method. 1183-1207 - Anil Damle, Yuekai Sun:
Uniform Bounds for Invariant Subspace Perturbations. 1208-1236 - Vincent Coppé, Daan Huybrechs, Roel Matthysen, Marcus Webb:
The AZ Algorithm for Least Squares Systems with a Known Incomplete Generalized Inverse. 1237-1259 - Tianxiang Liu, Ivan Markovsky, Ting Kei Pong, Akiko Takeda:
A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints. 1260-1283 - Wim Michiels, Luca Fenzi:
Spectrum-based Stability Analysis and Stabilization of Time-periodic Time-delay Systems. 1284-1311 - Jorge Garza-Vargas, Archit Kulkarni:
The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output. 1312-1346 - Cyrus Mostajeran, Christian Grussler, Rodolphe Sepulchre:
Geometric Matrix Midranges. 1347-1368 - Samantha Sherman, Tamara G. Kolda:
Estimating Higher-Order Moments Using Symmetric Tensor Decomposition. 1369-1387 - Carla Ferreira, Beresford N. Parlett:
Eigenpairs of Wilkinson Matrices. 1388-1415 - Ziang Chen, Yingzhou Li, Jianfeng Lu:
Tensor Ring Decomposition: Optimization Landscape and One-loop Convergence of Alternating Least Squares. 1416-1442 - Spyridon Pougkakiotis, John W. Pearson, Santolo Leveque, Jacek Gondzio:
Fast Solution Methods for Convex Quadratic Optimization of Fractional Differential Equations. 1443-1476
Volume 41, Number 4, 2020
- Silvia Gazzola, Chang Meng, James G. Nagy:
Krylov Methods for Low-Rank Regularization. 1477-1504 - Biswajit Das, Shreemayee Bora:
Nearest Matrix Polynomials With a Specified Elementary Divisor. 1505-1527 - Frank Uhlig:
Coalescing Eigenvalues and Crossing Eigencurves of 1-Parameter Matrix Flows. 1528-1545 - Minghua Chen, Sven-Erik Ekström, Stefano Serra-Capizzano:
A Multigrid Method for Nonlocal Problems: Non-Diagonally Dominant or Toeplitz-Plus-Tridiagonal Systems. 1546-1570 - Henri Calandra, Serge Gratton, Elisa Riccietti, Xavier Vasseur:
On Iterative Solution of the Extended Normal Equations. 1571-1589 - Alexander Beigl, Jarle Sogn, Walter Zulehner:
Robust Preconditioners for Multiple Saddle Point Problems and Applications to Optimal Control Problems. 1590-1615 - Miguel D. Bustamante, Pauline Mellon, M. Victoria Velasco:
Solving the Problem of Simultaneous Diagonalization of Complex Symmetric Matrices via Congruence. 1616-1629 - Pengzhan Jin, Yifa Tang, Aiqing Zhu:
Unit Triangular Factorization of the Matrix Symplectic Group. 1630-1650 - Alice Cortinovis, Daniel Kressner:
Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection. 1651-1673 - Andreas Frommer, Behnam Hashemi:
Computing Enclosures for the Matrix Exponential. 1674-1703 - Steffen Börm, Christina Börst:
Hybrid Matrix Compression for High-Frequency Problems. 1704-1725 - Ilse C. F. Ipsen, Hua Zhou:
Probabilistic Error Analysis for Inner Products. 1726-1741 - Ke Chen, Qin Li, Kit Newton, Stephen J. Wright:
Structured Random Sketching for PDE Inverse Problems. 1742-1770 - Ding Lu:
Nonlinear Eigenvector Methods for Convex Minimization over the Numerical Range. 1771-1796 - Yuning Yang:
The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence. 1797-1825 - Alan Edelman, Yuyang Wang:
The GSVD: Where are the Ellipses?, Matrix Trigonometry, and More. 1826-1856 - Rihuan Ke, Michael K. Ng, Ting Wei:
Efficient Preconditioning for Time Fractional Diffusion Inverse Source Problems. 1857-1888 - Marija Dodig, Marko Stosic:
Rank One Perturbations of Matrix Pencils. 1889-1911 - Jun Liu, Shu-Lin Wu:
A Fast Block α-Circulant Preconditoner for All-at-Once Systems From Wave Equations. 1912-1943 - Tim Mitchell:
Computing the Kreiss Constant of a Matrix. 1944-1975
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-25 23:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
