The search session has expired. Please query the service again.

Displaying 921 – 940 of 1340

Showing per page

Pentadiagonal Companion Matrices

Brydon Eastman, Kevin N. Vander Meulen (2016)

Special Matrices

The class of sparse companion matrices was recently characterized in terms of unit Hessenberg matrices. We determine which sparse companion matrices have the lowest bandwidth, that is, we characterize which sparse companion matrices are permutationally similar to a pentadiagonal matrix and describe how to find the permutation involved. In the process, we determine which of the Fiedler companion matrices are permutationally similar to a pentadiagonal matrix. We also describe how to find a Fiedler...

Performance of parallel QR factorization methods on the NVIDIA Grace CPU Superchip

Břichňáč, Vít, Šístek, Jakub (2025)

Programs and Algorithms of Numerical Mathematics

This article studies several algorithms for QR factorization based on hierarchical Householder reflectors organized into elimination trees, which are particularly suited for tall-and-skinny matrices and allow parallelization. We examine the effect of various parameters on the performance of the tree-based algorithms. The work is accompanied with a custom implementation that utilizes a task-based runtime system (OpenMP or StarPU). The same algorithm is implemented in the PLASMA library. The performance...

Pivoting algorithm in class of ABS methods

Gabriela Kálnová (1996)

Archivum Mathematicum

Summary: The paper deals with a pivoting modification of the algorithm in the class of ABS methods. Numerical experiments compare this pivoting modification with the fundamental version. A hybrid algorithm for the solution of the linear system with the Hankel matrix is introduced.

Currently displaying 921 – 940 of 1340