Complex matrix inversion via real matrix inversions
From MaRDI portal
Publication:6644044
DOI10.1007/S00211-024-01441-8MaRDI QIDQ6644044
Publication date: 27 November 2024
Published in: Numerische Mathematik (Search for Journal in Brave)
Theory of matrix inversion and generalized inverses (15A09) Direct numerical methods for linear systems and matrix inversion (65F05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph invertibility and median eigenvalues
- A computational method for eigenvalues and eigenvectors of a matrix with real eigenvalues
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- The matrix sign decomposition and its relation to the polar decomposition
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- The sign matrix and the separation of matrix eigenvalues
- Computation of the Fisher information matrix for time series models
- Elliptic curves over real quadratic fields are modular
- Gaussian elimination is not optimal
- Efficient solution of \(A x^{(k)}= b^{(k)}\) using \(A^{ - 1}\)
- Numerical computing with IEEE floating point arithmetic. Incl. one theorem, one rule of thumb, and one hundred and one exercises
- An Introduction to Mathematical Cryptography
- Field Theory
- Computing the Polar Decomposition—with Applications
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
- On the Asymptotic Complexity of Matrix Multiplication
- Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications
- On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function
- Further comments on "A note on the inversion of complex matrices"
- Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
- On inversion of complex matrices
- The Spectral Decomposition of Nonsymmetric Matrices on Distributed Memory Parallel Computers
- A note on the inversion of complex matrices
- Inverses of bicyclic graphs
- Methods for Modifying Matrix Factorizations
- Accuracy and Stability of Numerical Algorithms
- Nearly Optimal Algorithms for Canonical Matrix Forms
- A new matrix inverse
- Advanced Topics in Computional Number Theory
- Functions of Matrices
- Inverse of a finite-field Vandermonde matrix (Corresp.)
- A New Algorithm for Inner Product
- On the number of multiplications necessary to compute certain functions
- Complex matrix inversion versus real
- Inversion of a complex matrix
- Cryptography
- On the Linear Independence of Fractional Powers of Integers
- Tensors in computations
- Numerical stability and tensor nuclear norm
- New bounds for matrix multiplication: from alpha to omega
This page was built for publication: Complex matrix inversion via real matrix inversions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644044)