Matrix Nearness Problems Revisited
math.NA, cs.NA
Submitted: 2026-10-29
Updated: 2026-11-14
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- Computing the nearest scattering passive system
- Nearest Reversible Markov Chains with Sparsity Constraints: An Optimization Approach
- Improving the robustness of neural ODEs with minimal weight perturbation
- Distance to nearest skew-symmetric matrix polynomials of bounded rank
- Structured distance to singularity as a nonlinear system of equations
- Matrix nearness problems: Do real inputs admit real solutions?
- Singular spaces for computing the structured distance to singularity
- Dykstra's Algorithm, ADMM, and Coordinate Descent: Connections, Insights, and Extensions
- Generalized matrix nearness problems II
Related papers
- Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
- A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
- Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
- Operator learning meets inverse problems: A probabilistic perspective
- Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers