The method of Christopherson for solving free boundary problems for infinite journal bearings by means of finite differences
Colin W. Cryer
Source record
Source: Crossref
Published: Jan 1, 1971
DOI: 10.1090/s0025-5718-1971-0298961-7
Open original source ↗Source abstract
A method for solving free boundary problems for journal bearings by means of finite differences has been proposed by Christopherson. We analyse Christopherson’s method in detail for the case of an infinite journal bearing where the free boundary problem is as follows: Given T > 0 T > 0 and h ( t ) h(t) find τ ∈ ( 0 , T ] \tau \in (0,T] and p ( t ) p(t) such that (i) [ h 3 p ′ ] ′ = h ′ [{h^3}p’]’ = h’ for t ∈ ( 0 , τ ) t \in (0,\tau ) , (ii) p ( 0 ) = 0 p(0) = 0 , (iii) p ( t ) = 0 p(t) = 0 for t ∈ [ τ , T ] t \in [\tau ,T] , and (iv) p ′ ( τ − 0 ) = 0 p’(\tau - 0) = 0 . First, it is shown that the discrete approximation is accurate to O ( [ Δ t ] 2 ) O({[\Delta t]^2}) where Δ t \Delta t is the step size. Next, it is shown that the discrete problem is equivalent to a quadratic programming problem. Then, the iterative method for computing the discrete approximation is analysed. Finally, some numerical results are given.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.