Spline collocation method for linear singular hyperbolic systems

Some classes of singular systems of partial differential equations with variable matrix coefficients and internal hyperbolic structure are considered. The spline collocation method is used to numerically solve such systems. Sufficient conditions for the convergence of the numerical procedure are obtained. Numerical results are presented.     

Extrapolation techniques for ill-conditioned linear systems

Summary. In this paper, the regularized solutions of an ill–conditioned system of linear equations are computed for several values of the regularization parameter . Then, these solutions are extrapolated at by various vector rational extrapolations techniques built for that purpose. These techniques are justified by an analysis of the regularized solutions based on the singular value decomposition and the generalized singular value decomposition. Numerical results illustrate the effectiveness of the procedures. Received June 23, 1997 / Revised version received October 24, 1997     

An alternating direction implicit method for orthogonal spline collocation linear systems

Summary An Alternating Direction Implicit method is analyzed for the solution of linear systems arising in high-order, tensor-product orthogonal spline collocation applied to some separable, second order, linear, elliptic partial differential equations in rectangles. On anNxN partition, with Jordan's selection of the acceleration parameters, the method requiresO(N ² ln ² N) arithmetic operations to produce an approximation whose accuracy, in theH ¹-norm, is that of the collocation solution.     

Multi-parameter regularization techniques for ill-conditioned linear systems

Summary.  When a system of linear equations is ill-conditioned, regularization techniques provide a quite useful tool for trying to overcome the numerical inherent difficulties: the ill-conditioned system is replaced by another one whose solution depends on a regularization term formed by a scalar and a matrix which are to be chosen. In this paper, we consider the case of several regularizations terms added simultaneously, thus overcoming the problem of the best choice of the regularization matrix. The error of this procedure is analyzed and numerical results prove its efficiency. Received January 15, 2002 / Revised version received July 31, 2002 / Published online October 29, 2002 Mathematics Subject Classification (1991): 65F05 – 65F22     

Block preconditioners for linear systems arising from multiscale collocation with compactly supported RBFs

Symmetric collocation methods with RBFs allow approximation of the solution of a partial differential equation, even if the right‐hand side is only known at scattered data points, without needing to generate a grid. However, the benefit of a guaranteed symmetric positive definite block system comes at a high computational cost. This cost can be alleviated somewhat by considering compactly supported RBFs and a multiscale technique. But the condition number and sparsity will still deteriorate with the number of data points. Therefore, we study certain block diagonal and triangular preconditioners. We investigate ideal preconditioners and determine the spectra of the preconditioned matrices before proposing more practical preconditioners based on a restricted additive Schwarz method with coarse grid correction. Numerical results verify the effectiveness of the preconditioners. Copyright © 2015 John Wiley & Sons, Ltd.     

A new approach for approximating linear elasticity problems

In this Note, we present and analyze a new method for approximating linear elasticity problems in dimension two or three. This approach directly provides approximate strains, i.e., without simultaneously approximating the displacements, in finite element spaces where the Saint Venant compatibility conditions are exactly satisfied in a weak form. To cite this article: P.G. Ciarlet, P. Ciarlet, Jr., C. R. Acad. Sci. Paris, Ser. I 346 (2008).     

Tractability of approximating multivariate linear functionals

We review selected tractability results for approximating linear tensor product functionals defined over reproducing kernel Hilbert spaces. This review is based on Volume II of our book Tractability of Multivariate Problems. In particular, we show that all nontrivial linear tensor product functionals defined over a standard tensor product unweighted Sobolev space suffer the curse of dimensionality and therefore they are intractable. To vanquish the curse of dimensionality we need to consider weighted spaces, in which all groups of variables are monitored by weights. We restrict ourselves to product weights and provide necessary and sufficient conditions on these weights to obtain various kinds of tractability.     

Spectral collocation method for linear fractional integro-differential equations

In this paper, we propose and analyze a spectral Jacobi-collocation method for the numerical solution of general linear fractional integro-differential equations. The fractional derivatives are described in the Caputo sense. First, we use some function and variable transformations to change the equation into a Volterra integral equation defined on the standard interval [-1,1]$[-1\text{,}1]$. Then the Jacobi–Gauss points are used as collocation nodes and the Jacobi–Gauss quadrature formula is used to approximate the integral equation. Later, the convergence order of the proposed method is investigated in the infinity norm. Finally, some numerical results are given to demonstrate the effectiveness of the proposed method.     

An adaptive boundary collocation method for linear PDEs

The article proposes an adaptive algorithm based on a boundary collocation method for linear PDEs satisfying the maximal principle with possibly nonlinear boundary conditions. Given the error tolerance and an initial number of terms in the solution expansion, the algorithm computes expansion coefficients by collocation of boundary conditions and evaluates the maximum absolute error on the boundary. If error exceeds the error tolerance, additional expansion terms and boundary collocation points are added and the process repeated until the tolerance is satisfied. The performance of the algorithm is illustrated by an example of the potential flow past a cylinder placed between parallel walls. © 1995 John Wiley & Sons, Inc.     

Fast algorithms for high-order spline collocation systems

Summary. In this paper, we present a complete eigenvalue analysis for arbitrary order -spline collocation methods applied to the Poisson equation on a rectangular domain with Dirichlet boundary conditions. Based on this analysis, we develop some fast algorithms for solving a class of high-order spline collocation systems which arise from discretizing the Poisson equation. Received April 8, 1997 / Revised version received August 29, 1997     

On a least-squares collocation method for linear differential-algebraic equations

Summary The aim of this note is to extend some results on least-squares collocation methods and to prove the convergence of a least-squares collocation method applied to linear differential-algebraic equations. Some numerical examples are presented.     

Spline collocation methods for linear multi-term fractional differential equations

Some regularity properties of the solution of linear multi-term fractional differential equations are derived. Based on these properties, the numerical solution of such equations by piecewise polynomial collocation methods is discussed. The results obtained in this paper extend the results of Pedas and Tamme (2011) [15] where we have assumed that in the fractional differential equation the order of the highest derivative of the unknown function is an integer. In the present paper, we study the attainable order of convergence of spline collocation methods for solving general linear fractional differential equations using Caputo form of the fractional derivatives and show how the convergence rate depends on the choice of the grid and collocation points. Theoretical results are verified by some numerical examples.     

Symmetric collocation methods for linear differential-algebraic boundary value problems

Summary. We present symmetric collocation methods for linear differential-algebraic boundary value problems without restrictions on the index or the structure of the differential-algebraic equation. In particular, we do not require a separation into differential and algebraic solution components. Instead, we use the splitting into differential and algebraic equations (which arises naturally by index reduction techniques) and apply Gau?-type (for the differential part) and Lobatto-type (for the algebraic part) collocation schemes to obtain a symmetric method which guarantees consistent approximations at the mesh points. Under standard assumptions, we show solvability and stability of the discrete problem and determine its order of convergence. Moreover, we show superconvergence when using the combination of Gau? and Lobatto schemes and discuss the application of interpolation to reduce the number of function evaluations. Finally, we present some numerical comparisons to show the reliability and efficiency of the new methods. Received September 22, 2000 / Revised version received February 7, 2001 / Published online August 17, 2001     

Spline collocation methods for linear multi-term fractional differential equations

Some regularity properties of the solution of linear multi-term fractional differential equations are derived. Based on these properties, the numerical solution of such equations by piecewise polynomial collocation methods is discussed. The results obtained in this paper extend the results of Pedas and Tamme (2011) [15] where we have assumed that in the fractional differential equation the order of the highest derivative of the unknown function is an integer. In the present paper, we study the attainable order of convergence of spline collocation methods for solving general linear fractional differential equations using Caputo form of the fractional derivatives and show how the convergence rate depends on the choice of the grid and collocation points. Theoretical results are verified by some numerical examples.     

An algorithm for approximating piecewise linear concave functions from sample gradients

An effective algorithm for solving stochastic resource allocation problems is to build piecewise linear, concave approximations of the recourse function based on sample gradient information. Algorithms based on this approach are proving useful in application areas such as the newsvendor problem, physical distribution and fleet management. These algorithms require the adaptive estimation of the approximations of the recourse function that maintain concavity at every iteration. In this paper, we prove convergence for a particular version of an algorithm that produces approximations from stochastic gradient information while maintaining concavity.     

On approximating periodic functions using linear approximation methods

In the paper, a generalization of a known theorem by Hardy and Young is obtained; a formula interrelating the integral of a 2π-periodic function over the period with the integral over the entire axis is established; new approximation characteristics for functions belonging to saturation classes of continuity modules of different orders for the spaces L_p of periodic functions are provided, and some issues concerning approximation, in the uniform metric, of continuous periodic functions even with respect to each of their variables and having nonnegative Fourier coefficients are considered. Bibliography: 17 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 337, 2006, pp. 134–164.     

On the existence of optimal affine methods for approximating linear functionals

The existence of an optimal affine method using linear information is established for the approximation of a linear functional on a convex set. This is a generalization of a result of S. A. Smolyak (“On Optimal Restoration of Functions and Functionals of Them,” Candidate Dissertation, Moscow State University, 1965).