Paper
Algorithm with variable coefficients for computing matrix inverses
Authors
Mihailo Krstić, Marko D. Petković, Kostadin Rajković, Marko Kostadinov
Abstract
We present a general scheme for the construction of new eficient generalized Schultz iterative methods for computing the inverse matrix. These methods have the form $$ X_{k+1} = X_k(a_0^{(k)}I+a_1^{(k)}AX_k),\quad k\in\mathbb{N}, $$ where $A$ is square real matrix and $a_0^{(k)}$ and $a_0^{(k)}$ are dynamical coefficients. We are going to present basic case of the problem, while formulas are derived analogically in other cases but are more complicated. Constructed method is optimal, meaning that coefficients are chosen in optimal way in terms of Frobenius norm. We have done some numerical testing that confirm theoretical approach. Through construction and numerical testing of method we have considered numerical stability as well. In the end, constructed method in it's final form is numerically stable and optimal.
Metadata
Related papers
Cosmic Shear in Effective Field Theory at Two-Loop Order: Revisiting $S_8$ in Dark Energy Survey Data
Shi-Fan Chen, Joseph DeRose, Mikhail M. Ivanov, Oliver H. E. Philcox • 2026-03-30
Stop Probing, Start Coding: Why Linear Probes and Sparse Autoencoders Fail at Compositional Generalisation
Vitória Barin Pacela, Shruti Joshi, Isabela Camacho, Simon Lacoste-Julien, Da... • 2026-03-30
SNID-SAGE: A Modern Framework for Interactive Supernova Classification and Spectral Analysis
Fiorenzo Stoppa, Stephen J. Smartt • 2026-03-30
Acoustic-to-articulatory Inversion of the Complete Vocal Tract from RT-MRI with Various Audio Embeddings and Dataset Sizes
Sofiane Azzouz, Pierre-André Vuissoz, Yves Laprie • 2026-03-30
Rotating black hole shadows in metric-affine bumblebee gravity
Jose R. Nascimento, Ana R. M. Oliveira, Albert Yu. Petrov, Paulo J. Porfírio,... • 2026-03-30
Raw Data (Debug)
{
"raw_xml": "<entry>\n <id>http://arxiv.org/abs/2603.08196v1</id>\n <title>Algorithm with variable coefficients for computing matrix inverses</title>\n <updated>2026-03-09T10:24:33Z</updated>\n <link href='https://arxiv.org/abs/2603.08196v1' rel='alternate' type='text/html'/>\n <link href='https://arxiv.org/pdf/2603.08196v1' rel='related' title='pdf' type='application/pdf'/>\n <summary>We present a general scheme for the construction of new eficient generalized Schultz iterative methods for computing the inverse matrix. These methods have the form $$ X_{k+1} = X_k(a_0^{(k)}I+a_1^{(k)}AX_k),\\quad k\\in\\mathbb{N}, $$ where $A$ is square real matrix and $a_0^{(k)}$ and $a_0^{(k)}$ are dynamical coefficients. We are going to present basic case of the problem, while formulas are derived analogically in other cases but are more complicated. Constructed method is optimal, meaning that coefficients are chosen in optimal way in terms of Frobenius norm. We have done some numerical testing that confirm theoretical approach. Through construction and numerical testing of method we have considered numerical stability as well. In the end, constructed method in it's final form is numerically stable and optimal.</summary>\n <category scheme='http://arxiv.org/schemas/atom' term='math.NA'/>\n <published>2026-03-09T10:24:33Z</published>\n <arxiv:primary_category term='math.NA'/>\n <author>\n <name>Mihailo Krstić</name>\n </author>\n <author>\n <name>Marko D. Petković</name>\n </author>\n <author>\n <name>Kostadin Rajković</name>\n </author>\n <author>\n <name>Marko Kostadinov</name>\n </author>\n </entry>"
}