The harmonic Lanczos bidiagonalization method can be used to compute the smallest singular triplets of a large matrix A. We prove that for good enough projection subspaces harmonic Ritz values converge if the columns of A are strongly linearly independent. On the other hand, harmonic Ritz values may miss some desired singular values when the columns of A are almost linearly dependent. Furthermo...

Recent years have witnessed the popularity of using rank minimization as a regularizer for various signal processing and machine learning problems. As rank minimization problems are often converted to nuclear norm minimization (NNM) problems, they have to be solved iteratively and each iteration requires computing a singular value decomposition (SVD). Therefore, their solution suffers from the ...

Minimum mode following algorithms are widely used for saddle point searching in chemical and material systems. Common to these algorithms is a component to find the minimum curvature mode of the second derivative, or Hessian matrix. Several methods, including Lanczos, dimer, Rayleigh-Ritz minimization, shifted power iteration, and locally optimal block preconditioned conjugate gradient, have be...

The key problem of the theory of exterior differential systems (EDS) is to decide whether or not a system is in involution. The special case of EDSs generated by one-forms (Pfaffian systems) can be adequately illustrated by a 2-dimensional example. In 4 dimensions two such problems arise in a natural way, namely, the Riemann-Lanczos and the Weyl-Lanczos problems. It is known from the work of Ba...

The Lanczos algorithm is applied to calculate some finite-temperature physical quantities, as well as the ground-state ones. We introduce the finite-temperature Lanczos algorithm and apply it for some current problems in the low-dimensional strongly correlated electron systems; the charge stripe, the pseudogap and phonon-induced anomalous ARPES spectrum in the high-Tc superconducting cuprates.

The global Lanczos algorithm for solving the RLCG interconnect circuits is presented in this paper. This algorithm is an extension of the standard Lanczos algorithm for multiple-inputs multiple-outputs (MIMO) systems. A new matrix Krylov subspace will be developed first. By employing the congruence transformation with the matrix Krylov subspace, the two-side oblique projection-based method can ...

An efficient method towards synthesis of 1,10-phenanthrolines is described. Through Lewis acid-catalyzed annulation reaction between 3-ethoxycyclobutanones and 8-aminoquinolines, a variety of unsymmetric and symmetric 1,10-phenanthroline derivatives were readily prepared with high regioselectivity at room temperature.

In this paper it is shown that a Lanczos potential for the Weyl curvature tensor does not exist for all spaces of dimension n ≥ 7. Whether there exists a Lanczos potential [1] for Weyl curvature tensors in dimensions n > 4 has still not been determined. Although Lanczos's original proof [1] for existence was flawed [2], there have subsequently been complete proofs for existence in four dimensio...

Given a square matrix and single right and left starting vectors, the classical nonsymmetric Lanczos process generates two sequences of biorthogonal basis vectors for the right and left Krylov subspaces induced by the given matrix and vectors. In this paper, we propose a Lanczos-type algorithm that extends the classical Lanczos process for single starting vectors to multiple starting vectors. G...

Approximations of expressions of the form If := trace(W T f(A)W ), where A ∈ Rm×m is a large symmetric matrix, W ∈ Rm×k with k ≪ m, and f is a function, can be computed without evaluating f(A) by applying a few steps of the global block Lanczos method to A with initial block-vector W . This yields a partial global Lanczos decomposition of A. We show that for suitable functions f upper and lower...