Existence and uniqueness of solutions of infinite systems of semilinear parabolic differential-functional equations in arbitrary domains in ordered banach spaces

We consider the Fourier first initial-boundary value problem for a weakly coupled infinite system of semilinear parabolic differential-functional equations of reaction-diffusion type in arbitrary (bounded or unbounded) domain. The right-hand sides of the system are functionals of unknown functions of the Volterra type. Differential-integral equations give examples of such equations. To prove the existence and uniqueness of the solutions, we apply the monotone iterative method. The underlying monotone iterative scheme can be used for the computation of numerical solution.     

Determining the boundary of a two-dimensional region from the solution of the external initial boundary-value problem for the heat equation

We determine the boundary of a two-dimensional region using the solution of the external initial boundary-value problem for the nonhomogeneous heat equation. The initial values for the boundary determination include the right-hand side of the equation and the solution of the initial boundary-value problem given for finitely many points outside the region. The inverse problem is reduced to solving a system of two integral equations nonlinear in the function defining the sought boundary. An iterative procedure is proposed for numerical solution of the problem involving linearization of integral equations. The efficiency of the proposed procedure is investigated by a computer experiment.     

Implicit algorithms for solving the Cauchy problem for the equations of the dynamics of mechanical systems

It is shown that in the numerical solution of the Cauchy problem for systems of second-order ordinary differential equations, when solved for the highest-order derivative, it is possible to construct simple and economical implicit computational algorithms for step-by-step integration without using laborious iterative procedures based on processes of the Newton-Raphson iterative type. The initial problem must first be transformed to a new argument — the length of its integral curve. Such a transformation is carried out using an equation relating the initial parameter of the problem to the length of the integral curve. The linear acceleration method is used as an example to demonstrate the procedure of constructing an implicit algorithm using simple iterations for the numerical solution of the transformed Cauchy problem. Propositions concerning the computational properties of the iterative process are formulated and proved. Explicit estimates are given for an integration stepsize that guarantees the convergence of the simple iterations. The efficacy of the proposed procedure is demonstrated by the numerical solution of three problems. A comparative analysis is carried out of the numerical solutions obtained with and without parametrization of the initial problems in these three settings. As a qualitative test the problem of the celestial mechanics of the “Pleiades” is considered. The second example is devoted to modelling the non-linear dynamics of an elastic flexible rod fixed at one end as a cantilever and coiled in its initial (static) state into a ring by a bending moment. The third example demonstrates the numerical solution of the problem of the “unfolding” of a mechanical system consisting of three flexible rods with given control input.     

Preconditioned CG-type methods for solving the coupled system of fundamental semiconductor equations

This paper presents some of the authors' experimental results in applying Preconditioned CG-type methods to nonsymmetric systems of linear equations arising in the numerical solution of the coupled system of fundamental stationary semiconductor equations. For this type of problem it is shown that these iterative methods are efficient both in computation times and in storage requirements. All results have been obtained on an HP 350 computer.     

Weighted least squares solutions to general coupled Sylvester matrix equations

This paper is concerned with weighted least squares solutions to general coupled Sylvester matrix equations. Gradient based iterative algorithms are proposed to solve this problem. This type of iterative algorithm includes a wide class of iterative algorithms, and two special cases of them are studied in detail in this paper. Necessary and sufficient conditions guaranteeing the convergence of the proposed algorithms are presented. Sufficient conditions that are easy to compute are also given. The optimal step sizes such that the convergence rates of the algorithms, which are properly defined in this paper, are maximized and established. Several special cases of the weighted least squares problem, such as a least squares solution to the coupled Sylvester matrix equations problem, solutions to the general coupled Sylvester matrix equations problem, and a weighted least squares solution to the linear matrix equation problem are simultaneously solved. Several numerical examples are given to illustrate the effectiveness of the proposed algorithms.     

Numerical performance of parallel group explicit solvers for the solution of fourth order elliptic equations

Many applications in applied mathematics and engineering involve numerical solutions of partial differential equations (PDEs). Various discretisation procedures such as the finite difference method result in a problem of solving large, sparse systems of linear equations. In this paper, a group iterative numerical scheme based on the rotated (skewed) five-point finite difference discretisation is proposed for the solution of a fourth order elliptic PDE which represents physical situations in fluid mechanics and elasticity. The rotated approximation formulas lead to schemes with lower computational complexities compared to the centred approximation formulas since the iterative procedure need only involve nodes on half of the total grid points in the solution domain. We describe the development of the parallel group iterative scheme on a cluster of distributed memory parallel computer using Message-Passing Interface (MPI) programming environment. A comparative study with another group iterative scheme derived from the centred difference formula is also presented. A detailed performance analysis of the parallel implementations of both group methods will be reported and discussed.     

Positive solutions and dynamics of a finite difference reaction–diffusion system

We investigate the dynamics and methods of computation for some nonlinear finite difference systems that are the discretized equations of a time-dependent and a steady-state reaction–diffusion problem. The formulation of the discrete equations for the time-dependent problem is based on the implicit method for parabolic equations, and the computational algorithm is based on the method of monotone iterations using upper and lower solutions as the initial iterations. The monotone iterative method yields improved upper and lower bounds of the solution in each iteration, and the sequence of iterations converges monotonically to a solution for both the time-dependent and the steady-state problems. An important consequence of this method is that it leads to a bifurcation point that determines the dynamic behavior of the time-dependent problem in relation to the corresponding steady-state problem. This bifurcation point also determines whether the steady-state problem has one or two non-negative solutions, and is explicitly given in terms of the physical parameters of the system and the type of boundary conditions. Numerical results are presented for both the time-dependent and the steady-state problems under various boundary conditions, including a test problem with known analytical solution. These numerical results exhibit the predicted dynamic behavior of the time-dependent solution given by the theoretical analysis. Also discussed are the numerical stability of the computational algorithm and the convergence of the finite difference solution to the corresponding continuous solution of the reaction–diffusion problem. © 1993 John Wiley & Sons, Inc.     

A Steffensen's type method in Banach spaces with applications on boundary-value problems

In this paper, a modified Steffensen's type iterative scheme for the numerical solution of a system of nonlinear equations is studied. Two convergence theorems are presented. The numerical solution of boundary-value problems by the multiple shooting method using the proposed iterative scheme is analyzed.     

Fast inexact subspace iteration for generalized eigenvalue problems with spectral transformation

We study inexact subspace iteration for solving generalized non-Hermitian eigenvalue problems with spectral transformation, with focus on a few strategies that help accelerate preconditioned iterative solution of the linear systems of equations arising in this context. We provide new insights into a special type of preconditioner with “tuning” that has been studied for this algorithm applied to standard eigenvalue problems. Specifically, we propose an alternative way to use the tuned preconditioner to achieve similar performance for generalized problems, and we show that these performance improvements can also be obtained by solving an inexpensive least squares problem. In addition, we show that the cost of iterative solution of the linear systems can be further reduced by using deflation of converged Schur vectors, special starting vectors constructed from previously solved linear systems, and iterative linear solvers with subspace recycling. The effectiveness of these techniques is demonstrated by numerical experiments.     

On some iterative numerical methods for a Volterra functional integral equation of the second kind

In this paper, we study an iterative numerical method for approximating solutions of a certain type of Volterra functional integral equations of the second kind (Volterra integral equations where both limits of integration are variables). The method uses the contraction principle and a suitable quadrature formula. Under certain conditions, we prove the existence and uniqueness of the solution and give error estimates for our approximations. We also included a numerical example which illustrates the fast approximations.     

Fast solution of elliptic control problems

Elliptic control problems with a quadratic cost functional require the solution of a system of two elliptic boundary-value problems. We propose a fast iterative process for the numerical solution of this problem. The method can be applied to very special problems (for example, Poisson equation for a rectangle) as well as to general equations (arbitrary dimensions, general region). Also, nonlinear problems can be treated. The work required is proportional to the work taken by the numerical solution of a single elliptic equation.     

A Jacobi–Davidson method for two‐real‐parameter nonlinear eigenvalue problems arising from delay‐differential equations

The critical delays of a delay‐differential equation can be computed by solving a nonlinear two‐parameter eigenvalue problem. The solution of this two‐parameter problem can be translated to solving a quadratic eigenvalue problem of squared dimension. We present a structure preserving QR‐type method for solving such quadratic eigenvalue problem that only computes real‐valued critical delays; that is, complex critical delays, which have no physical meaning, are discarded. For large‐scale problems, we propose new correction equations for a Newton‐type or Jacobi–Davidson style method, which also forces real‐valued critical delays. We present three different equations: one real‐valued equation using a direct linear system solver, one complex valued equation using a direct linear system solver, and one Jacobi–Davidson style correction equation that is suitable for an iterative linear system solver. We show numerical examples for large‐scale problems arising from PDEs. Copyright © 2012 John Wiley & Sons, Ltd.     

Convergence of an Alternating Method to Solve the Cauchy Problem for Poisson's Equation

This work concerns the development of iterative algorithms for the solution of the Cauchy problem for the Poisson equation. We accelerate the process proposed by Kozlov et al. [V.A. Kozlov, V.G. Maz'ya and A.V. Fomin (1991). An iterative method for solving the Cauchy problem for elliptic equations. Comput. Maths. Phys. , 31 (1), 45-52.] by making use of a relaxation of the Dirichlet data. We provide theoretical justification of the convergence of the new algorithm, and present some results of numerical experiments with the method.     

Monotone-iterative method for mixed boundary value problems for generalized difference equations with “maxima”

In this paper the authors investigate special type of difference equations which involve both delays and the maximum value of the unknown function over a past time interval. This type of equations is used to model a real process which present state depends significantly on its maximal value over a past time interval. An appropriate mixed boundary value problem for the given nonlinear difference equation is set up. An algorithm, namely, the monotone iterative technique is suggested to solve this problem approximately. An important feature of our algorithm is that each successive approximation of the unknown solution is equal to the unique solution of an appropriately constructed initial value problem for a linear difference equation with “maxima”, and a formula for its explicit form is given. Also, each approximation is a lower/upper solution of the given nonlinear boundary value problem. Several numerical examples are considered to illustrate the practical application of the suggested algorithm.     

On nonlinear Fredholm integral equations with non-differentiable Nemystkii operator

From decomposition method for operators, we consider a Newton-Steffensen iterative scheme for approximating a solution of nonlinear Fredholm integral equations with non-differentiable Nemystkii operator. By means of a convergence study of the iterative scheme applied to this type of nonlinear Fredholm integral equations, we obtain domains of existence and uniqueness of solution for these equations. In addition, we illustrate this study with a numerical experiment.     

Solution of the 2-D eddy current problem via the domain decomposition methods on serial and parallel computers

Domain decomposition algorithms are applied to the solution of a time harmonic two-dimensional eddy current problem. The system of differential equations describing this problem is considered as a singularly perturbed problem. An iterative domain decomposition algorithm suitable for parallelization is described, and convergence of this algorithm is established. The implementation on a shared memory multiprocessor is described, and numerical experiments are presented.     

Weighted iterative solutions of linear differential equations and heat conduction of ideal gases in moment theory

An iterative method is proposed to find a particular solution of a system of linear differential equations, in the form of a fixed-point problem, with no boundary conditions. To circumvent the unboundedness of differential operators, iterative approximation with gradually decreasing weight is used. Conditions for convergence that can easily be checked in numerical iterations are established. Furthermore, for the numerical iterative scheme, uniqueness and stability theorems are proved. These results are applied to heat conduction of ideal gases in moment theory.     

Weighted iterative solutions of linear differential equations and heat conduction of ideal gases in moment theory

An iterative method is proposed to find a particular solution of a system of linear differential equations, in the form of a fixed-point problem, with no boundary conditions. To circumvent the unboundedness of differential operators, iterative approximation with gradually decreasing weight is used. Conditions for convergence that can easily be checked in numerical iterations are established. Furthermore, for the numerical iterative scheme, uniqueness and stability theorems are proved. These results are applied to heat conduction of ideal gases in moment theory.     

On an iterative method for a class of integral equations of the first kind

In this paper, we investigate an iterative method which has been proposed [1] for the numerical solution of a special class of integral equations of the first kind, where one of the essential assumptions is the positivity of the kernel and the given right-hand side. Integral equations of this special type occur in experimental physics, astronomy, medical tomography and other fields where density functions cannot be measured directly, but are related to observable functions via integral equations. In order to take into account the non-negativity of density functions, the proposed iterative scheme was defined in such a way that only non-negative solutions can be approximated. The first part of the paper presents a motivation for the iterative method and discusses its convergence. In particular, it is shown that there is a connection between the iterative scheme and a certain concave functional associated with integral equations of this type. This functional can be interpreted as a generalization of the log-likelihood function of a model from emission tomography. The second part of the paper investigates the convergence properties of the discrete analogue of the iterative method associated with the discretized equation. Sufficient conditions for local convergence are given; and it is shown that, in general, convergence is very slow. Two numerical examples are presented.     

Minimal residual methods for large scale Lyapunov equations

Projection methods have emerged as competitive techniques for solving large scale matrix Lyapunov equations. We explore the numerical solution of this class of linear matrix equations when a Minimal Residual (MR) condition is used during the projection step. We derive both a new direct method, and a preconditioned operator-oriented iterative solver based on CGLS, for solving the projected reduced least squares problem. Numerical experiments with benchmark problems show the effectiveness of an MR approach over a Galerkin procedure using the same approximation space.