Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
An algebraic quantum circuit compression algorithm for hamiltonian simulation
Quantum computing is a promising technology that harnesses the peculiarities of quantum
mechanics to deliver computational speedups for some problems that are intractable to …
mechanics to deliver computational speedups for some problems that are intractable to …
[کتاب][B] A Journey through the History of Numerical Linear Algebra
C Brezinski, G Meurant, M Redivo-Zaglia - 2022 - SIAM
A Journey through the History of Numerical Linear Algebra: Back Matter Page 1 Bibliography
[1] A. Abdelfattah, H. Anzt, A. Bouteiller, A. Danalis, JJ Dongarra, M. Gates, A. Haidar, J. Kurzak …
[1] A. Abdelfattah, H. Anzt, A. Bouteiller, A. Danalis, JJ Dongarra, M. Gates, A. Haidar, J. Kurzak …
Low-rank approximation in the Frobenius norm by column and row subset selection
A CUR approximation of a matrix A is a particular type of low-rank approximation A≈CUR,
where C and R consist of columns and rows of A, respectively. One way to obtain such an …
where C and R consist of columns and rows of A, respectively. One way to obtain such an …
Nonsingular systems of generalized Sylvester equations: an algorithmic approach
We consider the uniqueness of solution (ie, nonsingularity) of systems of r generalized
Sylvester and⋆‐Sylvester equations with n× n coefficients. After several reductions, we show …
Sylvester and⋆‐Sylvester equations with n× n coefficients. After several reductions, we show …
On the stability radius for linear time-delay systems
A Malyshev, M Sadkane - BIT Numerical Mathematics, 2024 - Springer
The exponential function that appears in the formula of the stability radius of linear time-
delay differential systems is approximated by its Padé approximant. This reduces the …
delay differential systems is approximated by its Padé approximant. This reduces the …
[PDF][PDF] Biorthogonal rational Krylov subspace methods
A general framework for oblique projections of non-Hermitian matrices onto rational Krylov
subspaces is developed. To obtain this framework we revisit the classical rational Krylov …
subspaces is developed. To obtain this framework we revisit the classical rational Krylov …
[HTML][HTML] Sampling the eigenvalues of random orthogonal and unitary matrices
We develop an efficient algorithm for sampling the eigenvalues of random matrices
distributed according to the Haar measure over the orthogonal or unitary group. Our …
distributed according to the Haar measure over the orthogonal or unitary group. Our …
[HTML][HTML] On the complex stability radius for time-delay differential-algebraic systems
A Malyshev, M Sadkane - Linear Algebra and its Applications, 2025 - Elsevier
An algorithm is proposed for computing the complex stability radius of a linear differential-
algebraic system with a single delay and including a neutral term. The exponential factor in …
algebraic system with a single delay and including a neutral term. The exponential factor in …
[HTML][HTML] An implicit filter for rational Krylov using core transformations
The rational Krylov method is a powerful tool for computing a selected subset of eigenvalues
in large-scale eigenvalue problems. In this paper we study a method to implicitly apply a …
in large-scale eigenvalue problems. In this paper we study a method to implicitly apply a …
A Provably Componentwise Backward Stable QR Algorithm for the Diagonalization of Colleague Matrices
The roots of a monic polynomial expressed in a Chebyshev basis are known to be the
eigenvalues of the so-called colleague matrix, which is a Hessenberg matrix that is the sum …
eigenvalues of the so-called colleague matrix, which is a Hessenberg matrix that is the sum …