Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Bujanović, Zvonimir"'
Various iterative eigenvalue solvers have been developed to compute parts of the spectrum for a large sparse matrix, including the power method, Krylov subspace methods, contour integral methods, and preconditioned solvers such as the so called LOBPC
Externí odkaz:
http://arxiv.org/abs/2405.11962
This paper investigates the detection of the rank of elliptic curves with ranks 0 and 1, employing a heuristic known as the Mestre-Nagao sum \[ S(B) = \frac{1}{\log{B}} \sum_{\substack{p
Externí odkaz:
http://arxiv.org/abs/2403.17626
The Schur decomposition of a square matrix $A$ is an important intermediate step of state-of-the-art numerical algorithms for addressing eigenvalue problems, matrix functions, and matrix equations. This work is concerned with the following task: Comp
Externí odkaz:
http://arxiv.org/abs/2203.10879
Autor:
Bujanović, Zvonimir, Kressner, Daniel
A few matrix-vector multiplications with random vectors are often sufficient to obtain reasonably good estimates for the norm of a general matrix or the trace of a symmetric positive semi-definite matrix. Several such probabilistic estimators have be
Externí odkaz:
http://arxiv.org/abs/2004.06433
Autor:
Bujanović, Zvonimir, Drmač, Zlatko
In this note we describe two modifications of the ScaLAPACK subroutines PxGEQPF for computing the QR factorization with the Businger-Golub column pivoting. First, we resolve a subtle numerical instability in the same way as we have done it for the LA
Externí odkaz:
http://arxiv.org/abs/1910.05623
Publikováno v:
SIAM J. Sci. Comput. 42(2020) A957-A996
In this paper, we discuss numerical methods for solving large-scale continuous-time algebraic Riccati equations. These methods have been the focus of intensive research in recent years, and significant progress has been made in both the theoretical u
Externí odkaz:
http://arxiv.org/abs/1811.00850
The QZ algorithm for computing eigenvalues and eigenvectors of a matrix pencil $A - \lambda B$ requires that the matrices first be reduced to Hessenberg-triangular (HT) form. The current method of choice for HT reduction relies entirely on Givens rot
Externí odkaz:
http://arxiv.org/abs/1710.08538
This paper proposes a combination of a hybrid CPU--GPU and a pure GPU software implementation of a direct algorithm for solving shifted linear systems $(A - \sigma I)X = B$ with large number of complex shifts $\sigma$ and multiple right-hand sides. S
Externí odkaz:
http://arxiv.org/abs/1708.06290
Publikováno v:
Numerische Mathematik volume 138 (2018)
This paper introduces a new algorithm for solving large-scale continuous-time algebraic Riccati equations (CARE). The advantage of the new algorithm is in its immediate and efficient low-rank formulation, which is a generalization of the Cholesky-fac
Externí odkaz:
http://arxiv.org/abs/1510.00040
Autor:
Benner, Peter, Bujanović, Zvonimir
Publikováno v:
In Linear Algebra and Its Applications 1 January 2016 488:430-459
