Advances in Computer Methods for Partial Differential Equations II: Proceedings of the Second IMACS (AICA) International Symposium on Computer Methods for Partial Differential Equations, Held at Lehigh University, Bethlehem, Pennsylvania, U.S.A., June 22-24, 1977Robert Vichnevetsky |
From inside the book
Results 1-3 of 41
Page 228
... initial conditions could be generated in several ways . Mathematically , a natural choice for an approximate initial condition uh is the best least - squares approximation to u ; this yields the condition , X- C ( 0 ) = g T = 9 19192 .9 ...
... initial conditions could be generated in several ways . Mathematically , a natural choice for an approximate initial condition uh is the best least - squares approximation to u ; this yields the condition , X- C ( 0 ) = g T = 9 19192 .9 ...
Page 247
... initial conditions for the next space of time . PROCEDURE AND HYBRID FORMULATION OF THE PROBLEM L ( εi , j'n CHANNEL A 2Ro FOURIER CONDITION 26x2 Ei + 1 , j + Ei - l , j ( 15 ) is valid in the domain and on the boundaries with Neumann ...
... initial conditions for the next space of time . PROCEDURE AND HYBRID FORMULATION OF THE PROBLEM L ( εi , j'n CHANNEL A 2Ro FOURIER CONDITION 26x2 Ei + 1 , j + Ei - l , j ( 15 ) is valid in the domain and on the boundaries with Neumann ...
Page 262
... initial guess for u2 ( x , 0 ) . Define a vector function v ( x , t ) ( v1 ( x , t ) , v2 ( x , t ) ) TM by : for Ot T , v ( x , t ) 1 = is the solution of ( 3 ) with initial conditions v1 ( x , 0 ) = u ( x , 0 ) and v2 ( x , 0 ) = g ...
... initial guess for u2 ( x , 0 ) . Define a vector function v ( x , t ) ( v1 ( x , t ) , v2 ( x , t ) ) TM by : for Ot T , v ( x , t ) 1 = is the solution of ( 3 ) with initial conditions v1 ( x , 0 ) = u ( x , 0 ) and v2 ( x , 0 ) = g ...
Contents
RECENT DEVELOPMENTS OF THE HOPSCOTCH METHOD A R Gourlay | 1 |
SOFTWARE FOR LINEAR ELLIPTIC PROBLEMS ON GENERAL TWO DIMENSIONAL DOMAINS E N Houstis | 7 |
THE MODIFIED CONJUGATE RESIDUAL METHOD FOR PARTIAL DIFFERENTIAL EQUATIONS R Chandra | 13 |
32 other sections not shown
Other editions - View all
Common terms and phrases
accuracy ADVANCES IN COMPUTER algebraic algorithm analog analysis analytical applied assumed block boundary conditions boundary value problem calculated cell coefficients collocation comparison components COMPUTER METHODS consider constant convergence cubic defined density dependent derivatives difference approximation discretization domain efficient elliptic equa error evaluation example Figure finite difference finite element method flow formulation Fourier Galerkin method Gaussian quadrature given Green's function grid hybrid computer IMACS IMACS AICA initial conditions integral equations L2 norm linear matrix mesh METHODS FOR PARTIAL nodes nonlinear numerical method numerical solution obtained ODE's operator ordinary differential equations parabolic parameter PARTIAL DIFFERENTIAL EQUATIONS PDE's points polynomials potential presented pressure procedure PUBL quadrature rectangular simulation singular solved space square steady step Table technique theorem tion trial functions variables variation vector velocity VICHNEVETSKY Editor zero