For with , the three Gershgorin discs have positive real centres , , , and radii , , . Centre minus radius is respectivelyThus none of the discs contains zero. By the Gershgorin circle theorem, zero is not an eigenvalue, so is nonsingular for every . Consequently
The Gershgorin discs of have radii . They too are disjoint and have one eigenvalue each. The disc centered at therefore improves the final bound toIt selects the same eigenvalue as before because all other discs lie a fixed positive distance from the disc centered at .
The claimed endpoint bounds with radius are false for positive corner perturbations. For example, take , and . The characteristic polynomial isThroughout , the absolute value of the sum of its first two terms is below , whereas . Hence this interval contains no root, contradicting the first requested bound. The actual eigenvalues are approximately , which also violate the last requested bound.
There is a valid real-eigenvalue conclusion with wider endpoint bounds. For and , the Gershgorin discs from rows have one enlarged component on the left; the Gershgorin discs from columns have one enlarged component on the right. Each has an enlarged radius . A small disc that meets the enlarged left disc has index satisfying . A small disc meeting the enlarged right disc satisfies . Thus, when , every disc with index at most is isolated in the column family and every disc with index at least is isolated in the row family. Their counts give all eigenvalues, one in each disjoint small disc, so all are real.
When , the same argument isolates the first discs in the column family and the last in the row family. It accounts for real eigenvalues. The one remaining eigenvalue is real by conjugation, and belongs to the central small disc: the enlarged left and right discs are disjoint, and their two components can intersect only within the disc centered at . Therefore the valid uniform bounds areThe sharper endpoint radii hold in part (d) when , and cannot simply be carried over to the perturbed matrix.
For each row, a Gershgorin disc has centre and radius . Here and , so the Gershgorin circle theorem givesSince is a real symmetric matrix, its eigenvalues are real. Intersecting the union of these Gershgorin discs with the real axis yieldsThis bound permits zero but does not assert a zero eigenvalue. The fixed-end Dirichlet boundary conditions exclude it: for any nonzero real vector , extend by and calculateIndeed, equality would force every adjacent value to agree with the zero endpoint. Thus is a symmetric positive-definite matrix, is a negative-definite matrix, and the eigenvalues satisfy . The same argument works for any number of interior grid points, with prefactor in the sum. The fixed string has no zero-frequency rigid translation.
Choose a fixed time increment , let , and approximate by . The Backward Euler method evaluates the transport term at the new time:Rearrange to the linear systemAlthough is a singular matrix, is an invertible matrix for every . In each row, its diagonal entry is and the sum of the absolute values of its off-diagonal entries is ; hence it is a strictly diagonally dominant matrix. Its Gershgorin discs have centre and radius , excluding zero. In particular, the zero eigenvalue of becomes an eigenvalue of .
- Form once. Compute a Pivoted LU decomposition , storing the permutation matrix , the unit lower triangular matrix , and the upper triangular matrix .
- Set .
- At each step form . Solve by forward substitution, then solve by back substitution.
- Advance and repeat until the desired final time. Choose the fixed increment so the final time is an integer multiple of , or refactor if a shorter final step is used.
Both triangular solves use the factors of . The LU factorization of the singular transport matrix from part (a) is not a solver for this new linear system. No matrix inverse needs to be formed. Since and are fixed, the same LU factorization serves every step; only the right-hand side changes. A varying would give without changing these factors.
As a check, multiplying the update by givesexactly reproducing the inventory balance at the sampled times, apart from roundoff error. The Backward Euler method has temporal global error for smooth solutions, so its A-stability does not remove the need to select for accuracy.