A multilevel characteristics method for periodic convection‐dominated diffusion problems

In this article we introduce a multilevel method in space and time for the approximation of a convection‐diffusion equation. The spatial discretization is of pseudo‐spectral Fourier type, while the time discretization relies on the characteristics method. The approximate solution is obtained as the sum of two components that are advanced in time using different time‐steps. In particular, this requires the introduction of two sets of discretized characteristics curves and of two interpolation operators. We investigate the stability of the scheme and derive some error estimates. They indicate that the high‐frequency term can be integrated with a larger time‐step. Numerical experiments illustrate the gain in computing time due to the multilevel strategy. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 107–132, 2000     

Performance and numerical behavior of the second‐order scheme of precise time‐step integration for transient dynamic analysis

Spurious high‐frequency responses resulting from spatial discretization in time‐step algorithms for structural dynamic analysis have long been an issue of concern in the framework of traditional finite difference methods. Such algorithms should be not only numerically dissipative in a controllable manner, but also unconditionally stable so that the time‐step size can be governed solely by the accuracy requirement. In this article, the issue is considered in the framework of the second‐order scheme of the precise integration method (PIM). Taking the Newmark‐β method as a reference, the performance and numerical behavior of the second‐order PIM for elasto‐dynamic impact‐response problems are studied in detail. In this analysis, the differential quadrature method is used for spatial discretization. The effects of spatial discretization, numerical damping, and time step on solution accuracy are explored by analyzing longitudinal vibrations of a shock‐excited rod with rectangular, half‐triangular, and Heaviside step impact. Both the analysis and numerical tests show that under the framework of the PIM, the spatial discretization used here can provide a reasonable number of model types for any given error tolerance. In the analysis of dynamic response, an appropriate spatial discretization scheme for a given structure is usually required in order to obtain an accurate and meaningful numerical solution, especially for describing the fine details of traction responses with sharp changes. Under the framework of the PIM, the numerical damping that is often required in traditional integration schemes is found to be unnecessary, and there is no restriction on the size of time steps, because the PIM can usually produce results with machine‐like precision and is an unconditionally stable explicit method. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Order Reduced Schemes for the Fourth Order Eigenvalue Problems on Multi-Connected Planar Domains

In this paper, we study the order reduced finite element method for the fourth order eigenvalue problems on multi-connected planar domains. Particularly, we take the biharmonic and the Helmholtz transmission eigenvalue problems as model problems, present for each an equivalent order reduced formulation and a corresponding stable discretization scheme, and present rigorous theoretical analysis. The schemes are readily fit for multilevel correction algorithms with optimal computational costs. Numerical experiments are given for verifications.     

Parallel Smoothed Aggregation Multilevel Schwarz Preconditioned Newton-Krylov Algorithms for Poisson-Boltzmann Problems

We study a multilevel Schwarz preconditioned Newton-Krylov algorithm to solve the Poisson-Boltzmann equation with applications in multi-particle colloidal simulation. The smoothed aggregation-type coarse mesh space is introduced in collaboration with the one-level Schwarz method as a composite preconditioner for accelerating the convergence of a Krylov subspace method for solving the Jacobian system at each Newton step. The important feature of the proposed solution algorithm is that the geometric mesh information needed for constructing the multilevel preconditioner is the same as the one-level Schwarz method on the fine mesh. Other components, such as the definition of the coarse mesh, all the mesh transfer operators, and the coarse mesh problem, are taken care of by the Trillinos/ML packages of the Sandia National Laboratories in the United States. After algorithmic parameter tuning, we show that the proposed smoothed aggregation multilevel Newton-Krylov-Schwarz (NKS) algorithm numerically outperforms than smoothed aggregation multigrid method and one-level version of the NKS algorithm with satisfactory parallel performances up to a few thousand cores. Besides, we investigate how the electrostatic forces between particles for the separation distance depend on the radius of spherical colloidal particles and valence ratios of cation and anion in a cubic system.     

Multilevel methods to solve the neutron diffusion equation

In this paper, we develop multilevel strategies to solve the time dependent neutron diffusion equation. These methodologies are based on the discretization of the spatial part of the neutron diffusion equation using a nodal collocation method which makes use of an expansion of the neutron flux in terms of Legendre polynomials. The different levels or grids of the multilevel strategies have been defined in terms of the different number of polynomials used for the nodal collocation method expansions instead of using different nodalization sizes. Results for two transients associated with the bidimensional TWIGL reactor are reported.     

Neumann Control of Unstable Parabolic Systems: Numerical Approach

The present article is concerned with the Neumann control of systems modeled by scalar or vector parabolic equations of reaction-advection-diffusion type with a particular emphasis on systems which are unstable if uncontrolled. To solve these problems, we use a combination of finite-difference methods for the time discretization, finite-element methods for the space discretization, and conjugate gradient algorithms for the iterative solution of the discrete control problems. We apply then the above methodology to the solution of test problems in two dimensions, including problems related to nonlinear models.     

两个带变时间步的两重网格算法的稳定性分析

对用于求解非线性发展方程的两个带变时间步的两重网格算法，对空间变量用有限元离散，对时间变量分别用一阶精度Euler显式和二阶精度半隐式差分格式离散，然后构造两重网格算法，通过深入的稳定性分析，得出本文的算法优于标准全离散有限元算法。     

High‐order characteristic‐tracking strategy for simulation of a nonlinear advection–diffusion equation

In this study, new high‐order backward semi‐Lagrangian methods are developed to solve nonlinear advection–diffusion type problems, which are realized using high‐order characteristic‐tracking strategies. The proposed characteristic‐tracking strategies are second‐order L‐stable and third‐order L(α)‐stable methods, which are based on a classical implicit multistep method combined with a error‐correction method. We also use backward differentiation formulas and the fourth‐order finite‐difference scheme for diffusion problem discretization in the temporal and spatial domains, respectively. To demonstrate the adaptability and efficiency of these time‐discretization strategies, we apply these methods to nonlinear advection–diffusion type problems such as the viscous Burgers' equation. Through simulations, not only the temporal and spatial accuracies are numerically evaluated but also the proposed methods are shown to be superior to the compared existing characteristic‐tracking methods under the same rates of convergence in terms of accuracy and efficiency. Finally, we have shown that the proposed method well preserves the energy and mass when the viscosity coefficient becomes zero.     

Bicriterion Weight Varying Spatial Price Networks

We consider a spatial price equilibrium problem in which the consumers take their decisions according to the transportation cost and transportation time necessary for obtaining a given commodity. In particular, each consumer market can give a different weight to each component of a generalized cost, and we suppose that this weight can depend on time. Thus, we are faced with a time-dependent equilibrium problem which we cast within the framework of variational inequalities. We give existence results and, by using the example of a linear operator, we propose also a discretization procedure for equilibrium problems which can be modeled by the same type of variational inequality.     

Convergence of a fitted finite volume method for the penalized Black–Scholes equation governing European and American Option pricing

In this paper we present an analysis of a numerical method for a degenerate partial differential equation, called the Black–Scholes equation, governing American and European option pricing. The method is based on a fitted finite volume spatial discretization and an implicit time stepping technique. The analysis is performed within the framework of the vertical method of lines, where the spatial discretization is formulated as a Petrov–Galerkin finite element method with each basis function of the trial space being determined by a set of two-point boundary value problems. We establish the stability and an error bound for the solutions of the fully discretized system. Numerical results are presented to validate the theoretical results.     

An adaptive least-squares collocation radial basis function method for the HJB equation

We present a novel numerical method for the Hamilton–Jacobi–Bellman equation governing a class of optimal feedback control problems. The spatial discretization is based on a least-squares collocation Radial Basis Function method and the time discretization is the backward Euler finite difference. A stability analysis is performed for the discretization method. An adaptive algorithm is proposed so that at each time step, the approximate solution can be constructed recursively and optimally. Numerical results are presented to demonstrate the efficiency and accuracy of the method.     

An efficient alternating direction method of multipliers for optimal control problems constrained by random Helmholtz equations

Based on the alternating direction method of multipliers (ADMM), we develop three numerical algorithms incrementally for solving the optimal control problems constrained by random Helmholtz equations. First, we apply the standard Monte Carlo technique and finite element method for the random and spatial discretization, respectively, and then ADMM is used to solve the resulting system. Next, combining the multi-modes expansion, Monte Carlo technique, finite element method, and ADMM, we propose the second algorithm. In the third algorithm, we preprocess certain quantities before the ADMM iteration, so that nearly no random variable is in the inner iteration. This algorithm is the most efficient one and is easy to implement. The error estimates of these three algorithms are established. The numerical experiments verify the efficiency of our algorithms.     

On parallel algorithms for semidiscretized parabolic partial differential equations based on subdiagonal Padé approximations

It is well known that methods for solving semidiscretized parabolic partial differential equations based on the second-order diagonal [1/1] Padé approximation (the Crank–Nicolson or trapezoidal method) can produce poor numerical results when a time discretization is imposed with steps that are “too large” relative to the spatial discretization. A monotonicity property is established for all diagonal Padé approximants from which it is shown that corresponding higher-order methods suffer a similar time step restriction as the [1/1] Padé. Next, various high-order methods based on subdiagonal Padé approximations are presented which, through a partial fraction expansion, are no more complicated to implement than the first-order implicit Euler method based on the [0/1] Padé approximation; moreover, the resulting algorithms are free of a time step restriction intrinsic to those based on diagonal Padé approximations. Numerical results confirm this when various test problems from the literature are implemented on a Multiple Instruction Multiple Data (MIMD) machine such as an Alliant FX/8. © 1993 John Wiley & Sons, Inc.     

On the abstract theory of additive and multiplicative Schwarz algorithms

Summary. In recent years, it has been shown that many modern iterative algorithms (multigrid schemes, multilevel preconditioners, domain decomposition methods etc.) for solving problems resulting from the discretization of PDEs can be interpreted as additive (Jacobi-like) or multiplicative (Gauss-Seidel-like) subspace correction methods. The key to their analysis is the study of certain metric properties of the underlying splitting of the discretization space into a sum of subspaces and the splitting of the variational problem on into auxiliary problems on these subspaces. In this paper, we propose a modification of the abstract convergence theory of the additive and multiplicative Schwarz methods, that makes the relation to traditional iteration methods more explicit. The analysis of the additive and multiplicative Schwarz iterations can be carried out in almost the same spirit as in the traditional block-matrix situation, making convergence proofs of multilevel and domain decomposition methods clearer, or, at least, more classical. In addition, we present a new bound for the convergence rate of the appropriately scaled multiplicative Schwarz method directly in terms of the condition number of the corresponding additive Schwarz operator. These results may be viewed as an appendix to the recent surveys [X], [Ys]. Received February 1, 1994 / Revised version received August 1, 1994     

Numerical and Stability Aspects of Non-Newtonian Fluid Flow

This paper is concerned with nonlinear rheological fluids of Oldroyd type. We present a (formal) stability analysis of the corresponding system of equations, showing stability limits on the Weißenberg number in certain cases. Moreover, we introduce a numerical method for solving the full time-dependent Oldroyd system based on the finite element spatial discretization and on the fractional step θ-scheme time approximation. Numerical solutions are presented for two well known benchmark problems: the lid driven cavity and the four-to-one planar contraction. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

半无限极大极小问题的全局收敛方法

利用广义伪方向导数，在较弱的条件下，给出了半无限极大极小问题（P）的全局收敛性理论算法模型；利用离散策略给出了问题（P）全局收敛的可实现算法．数值结果表明本文给出的可实现算法是有效的．     

Hilbert尺度下求解非线性不适定问题的多水平迭代法

本文吸取了多水平方法的思想，采用多水平方法提供了离散化参数和迭代初值的合理的选择方法，提出了Hilbert尺度下求解非线性不适定问题的多水平Landweber迭代算法，并给出了算法的收敛性分析，证明了算法在整体上提高了Hilbert尺度下的Landweber迭代法的迭代效率。     

An Accurate Space–Time Pseudospectral Method for Solving Nonlinear Multi-Dimensional Heat Transfer Problems

In this paper, we consider the numerical solution of the nonlinear one- and two-dimensional heat transfer problems subject to the given initial conditions and linear Robin boundary conditions. We propose a pseudospectral scheme in both time and spatial discretizations for these problems. The discretization processes are constructed through the multi-variate interpolation of the desired solutions in terms of Chebyshev Gauss Lobbato collocation points. Operational matrices of differentiation are constructed via the tensor products for speeding up of the proposed numerical algorithms’ implementation. Some test problems are provided and the numerical simulations are illustrated to show the spectral accuracy in both space and time of the suggested scheme.     

Adaptive finite element procedures for elastoplastic problems at finite strains

A major difficulty in the context of adaptive analysis of geometrically nonlinear problems is to provide a robust remeshing procedure that accounts both for the error caused by the spatial discretization and for the error due to the time discretization. For stability problems, such as strain localization and necking, it is essential to provide a step–size control in order to get a robust algorithm for the solution of the boundary value problem. For this purpose we developed an easy to implement step–size control algorithm. In addition we will consider possible a posteriori error indicators for the spatial error distribution of elastoplastic problems at finite strains. This indicator is adopted for a density–function–based adaptive remeshing procedure. Both error indicators are combined for the adaptive analysis in time and space. The performance of the proposed method is documented by means of representative numerical examples.     

Fully discrete finite element approximations of the forced Fisher equation

We consider fully discrete finite element approximations of the forced Fisher equation that models the dynamics of gene selection/migration for a diploid population with two available alleles in a multidimensional habitat and in the presence of an artificially introduced genotype. Finite element methods are used to effect spatial discretization and a nonstandard backward Euler method is used for the time discretization. Error estimates for the fully discrete approximations are derived by applying the Brezzi-Rappaz-Raviart theory for the approximation of a class of nonlinear problems. The approximation schemes and error estimates are applicable under weaker regularity hypotheses than those that are typically assumed in the literature. The algorithms and analyses, although presented in the concrete setting of the forced Fisher equation, also apply to a wide class of semilinear parabolic partial differential equations.