Intereting Posts

Determine the centre of a circle
Need help with understanding the Basis for a Topology
Non-revealing maximum
Probability distribution for the position of a biased random walker on the positive integers
problem on intersecting circles
Is $\frac{\sqrt{x}}{a}+\frac{\sqrt{y}}{b}=1$ the equation of a parabola tangent to the coordinate axes?
Cardinality of $GL_n(K)$ when $K$ is finite
Limit of the derivative and LUB
Describe all ring homomorphisms
Interchange supremum and expectation
Much less than, what does that mean?
Plot of x^(1/3) has range of 0-inf in Mathematica and R
Equation of line in form of determinant
How many distinct factors of $n$ are less than $x$?
If $ \cos x +2 \cos y+3 \cos z=0 , \sin x+2 \sin y+3 \sin z=0$ and $x+y+z=\pi$. Find $\sin 3x+8 \sin 3y+27 \sin 3z$

I am trying to implement the Lanczos algorithm. If I implement it in Fortran or C, (i.e. in finite precision), will the vectors generated at each iteration still preserve their linear independence? Thanks.

- A non-square matrix with orthonormal columns
- Uniqueness of the Jordan decomposition.
- Most important Linear Algebra theorems?
- Rotate an area around a diagonal line.
- Rigorous proof that any linear map between vector spaces can be represented by a matrix
- Cute Determinant Question
- Fast(est) and intuitive ways to look at matrix multiplication?
- Rank of the differential
- Questions about rank and eigenvalues of a matrix
- Prove that the trace of the matrix product $U'AU$ is maximized by setting $U$'s columns to $A$'s eigenvectors

**Absolutely not**. Krylov vectors will quickly loose orthogonality. This applies to all Krylov-type processes, including Lanczos, Arnoldi, Golub-Kahan, Lanczos bi-orthogonalization, etc. That is the one major difficulty with all Krylov-type algorithms (CG, MINRES, GMRES, QMR, TFQMR, Bi-CGSTAB, Bi-CG, CGS, etc, etc.)

Most implementations make provision for a reorthogonalization procedure. Full reorthogonalization (i.e., against all previously-generated Krylov vectors) is not only very expensive, it has also been shown to be unnecessary. Partial reorthogonalization is a very popular alternative that comes in different forms. Your question is very far-reaching and the negative answer has too many implications to list. I recommend reading some of the following excellent books. They point to research paper where you can find more details.

- G. Meurant, The Lanczos and Conjugate Gradient Algorithms: From Theory to Finite Precision Computations
- Y. Saad, Iterative Methods for Sparse Linear Systems
- C. T. Kelley, Iterative Methods for Linear and Nonlinear Equations
- A. Greenbaum, Iterative Methods for Solving Linear Systems

Michael Saunders has excellent class notes at Stanford that summarize the state of the art: http://stanford.edu/class/msande318/notes.html.

In finite precision, there is already an important difference in the Arnoldi process depending on whether you implement the standard Gram-Schmidt update or the modified Gram-Schmidt update. For a quick overview, google “modified gram schmidt giraud langou” in Google Scholar.

They TEND to align — they don’t become completely parallel. By all means, you can use Gram-Schmidt orthogonalization. Dr. Underwood’s classic program on netlib.org does exactly that.

Given the number of Lanczos programs available, why write another one? Look into ARPACK, underwood.f, or LASO2 for a good solution.

- Computing the Hilbert class field
- The curve $x^3− y^3= 1$ is asymptotic to the line $x = y$. Find the point on the curve farthest from the line $x = y$
- How to solve 5×5 grid with 16 diagonals?
- Convergence of the sequence $\sqrt{1+2\sqrt{1}},\sqrt{1+2\sqrt{1+3\sqrt{1}}},\sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1}}}},\cdots$
- Cutting a Möbius strip down the middle
- Functions continuous in each variable
- Multiplying three factorials with three binomials in polynomial identity
- Prove that: $\sum\limits_{n=1}^\infty \dfrac{n^2}{2^n}=6$.
- product of path connected space is path connected
- Midpoint-Convex and Continuous Implies Convex
- How to Determine Interval $$ for a Fixed-Point Iteration?
- Does Euler's $\phi$ function have the same value in arbitrarily large subsets of $\mathbb{N}$?
- Complex analysis book for Algebraic Geometers
- Approximating Borel sets by finite unions of intervals
- A proposition on a Dedekind domain