The nonlinear Fourier transform, which is also known as the forward scattering transform,
decomposes a periodic signal into nonlinearly interacting waves. In contrast to the common …

Solving systems of algebraic linear equations is among the most frequent problems in
scientific computing. It appears in many areas like physics, engineering, chemistry, biology …

A stable algorithm to compute the roots of polynomials is presented. The roots are found by
computing the eigenvalues of the associated companion matrix by Francis's implicitly shifted …

The nonlinear Fourier transform (NFT; also: direct scattering transform) is discussed with
respect to the focusing nonlinear Schrödinger equation on the infinite line. It is shown that …

For dense symmetric matrices with small off-diagonal (numerical) ranks and in a
hierarchically semiseparable form, we give a divide-and-conquer eigendecomposition …

Core-Chasing Algorithms for the Eigenvalue Problem : Back Matter Page 1 Bibliography [1] GS
Ammar, WB Gragg, and L. Reichel. On the eigenproblem for orthogonal matrices. In Proceedings …

In this paper, we propose a structured bisection method with adaptive randomized sampling
for finding selected or all of the eigenvalues of certain real symmetric matrices A. For A with …

Computing Handbook, Third Edition: Computer Science and Software Engineering mirrors
the modern taxonomy of computer science and software engineering as described by the …

The identification of influential nodes in complex networks is an interesting problem.
Traditional approaches, such as metric-and machine learning-based approaches, often fail …

A typical iterative polynomial root-finder begins with a relatively slow process of computing a
crude but sufficiently close initial approximation to a root and then rapidly refines it. The …