Two formal grammars over the same terminal alphabet are isomorphic when there is a bijection between their nonterminals such that and
where is extended to words by fixing each terminal and acting symbol by symbol.
Two formal grammars over the same terminal alphabet are equivalent when they generate the same language:
For the formal grammar ,
Thus contains exactly the finite terminal words reachable from the start symbol by a finite grammar derivation.
Put . Then
For an eigenvalue , the corresponding block has characteristic polynomial
For ,
so the polynomial is
For , it is
Its discriminant is , so its conjugate roots have product and modulus . Both blocks therefore have the same spectral radius, and
This is the heavy-ball rate for a two-eigenvalue diagonal quadratic.
By contrast, the steepest-descent factor is
The heavy-ball factor is , which is substantially smaller for : it gives an iteration scale of order rather than order .
Because , the error obeys
Thus the heavy-ball error propagation matrix is
If , permute the coordinates from
to
For the corresponding permutation matrix ,
Since , the Heavy-ball method is
Multiplication by and use of give the heavy-ball residual recurrence
With the usual initialization , both initial residuals equal . Induction in the recurrence shows that
for a polynomial of degree at most . Therefore
This is under the zero-indexed Krylov subspace convention in the question; under the convention whose order- space ends at , it is .
For
the gradient is . The steepest descent method with exact line search for a positive-definite quadratic therefore uses
For and , the minimizer is . Put
Starting from , direct substitution gives and, inductively,
The Euclidean norm is unchanged by the alternating sign, so
For a positive-definite matrix, the spectral condition number of a positive-definite matrix is
Here , and hence
The Conjugate gradient method starts with and updates
By finite termination of the conjugate gradient method, it reaches the exact solution in at most the number of distinct eigenvalues. This matrix has two, so at most
are required in exact arithmetic.
The leading shear stress exerted by the fluid on the lower surface is
The horizontal force per unit span is . Substituting the pressure gradient from part (c) gives
Using the value of and setting this force to zero yields
Consequently the zero-shear lower wall in a translating and squeezing finite gap condition is
When , put
The pressure gradient from part (c) reduces to
Because , is a weighted mean of points in and therefore belongs to ; it lies strictly inside unless the weight is singularly concentrated at an endpoint. Thus , proving that the pressure gradient vanishes somewhere between the ends.
Integrating the incompressible continuity equation across the moving gap, with and , gives the Reynolds lubrication equation
Hence
for a constant , and the flux formula from part (b) gives
Define the spatial mean
Because both ends meet fluid at pressure , the pressure recovery condition in lubrication flow is
It determines
Therefore the requested pressure gradient in a translating and squeezing finite gap is
The leading streamwise momentum equation in lubrication theory is
with . The no-slip boundary condition is
Twice integrating in gives the local Couette-Poiseuille flow in a thin gap
Its volume flux per unit span is

There are unlisted articles, also show them or only show them.