Computing adjoint mismatch of linear maps

DOI10.1016/J.CAM.2026.117853MaRDI QIDQ7309254zbMATH OpenFDO

Authors Jonas Bresch, Dirk A. Lorenz, Felix Schneppe, M. Winkler

Publication date 4 August 2026

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CAM.2026.117853

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical computation of matrix norms, conditioning, scaling (65F35) Randomized algorithms (68W20)

Cites work

• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Chambolle-Pock's primal-dual method with mismatched adjoint
• Convergence Analysis of Pixel-Driven Radon and Fanbeam Transforms
• Convergence of proximal gradient algorithm in the presence of adjoint mismatch
• Convergence Results for Primal-Dual Algorithms in the Presence of Adjoint Mismatch
• Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
• Linearly convergent adjoint free solution of least squares problems by random descent
• Monte Carlo estimators for the Schatten \(p\)-norm of symmetric positive semidefinite matrices
• Randomized numerical linear algebra: Foundations and algorithms
• Statistical Condition Estimation for Linear Systems
• The randomized Kaczmarz method with mismatched adjoint
• Transpose-free formulations of Lanczos-type methods for nonsymmetric linear systems
• Transpose-free Lanczos-type algorithms for nonsymmetric linear systems

Cited in

(1)

• Matrix-free stochastic calculation of operator norms without using adjoints

This page was built for publication: Computing adjoint mismatch of linear maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7309254)