Efficient solution of A x^(k)= b^(k) using A^ - 1
From MaRDI portal
Publication:2641365
DOI10.1007/S10915-006-9112-XzbMATH Open1120.65033OpenAlexW1980062440MaRDI QIDQ2641365FDOQ2641365
Authors: A. Ditkowski, Gadi Fibich, Nir Gavish
Publication date: 20 August 2007
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-006-9112-x
Recommendations
- Efficient computation of the extreme solutions of $X+A^*X^{-1}A=Q$ and $X-A^*X^{-1}A=Q$
- An approach to solving \(A^{k}=J-I\)
- An efficient solution of the congruence<tex>x^2 + ky^2 = mpmod{n}</tex>
- A computational approach for solving $y^2=1^k+2^k+\dotsb+x^k$
- Solving \(x^{2^k + 1} + x + a = 0\) in \(\mathbb{F}_{2^n}\) with \(\gcd(n, k) = 1\)
- Several methods to solve \(A^TXA-X=Q\)
- On the Equation a x - b y = 1
- scientific article; zbMATH DE number 1220688
- Solving \(XX^{tr}=A\) over the integers
Cites Work
Cited In (4)
Uses Software
This page was built for publication: Efficient solution of \(A x^{(k)}= b^{(k)}\) using \(A^{ - 1}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641365)