On Frobenius normwise condition numbers for Moore–Penrose inverse and linear least‐squares problems

Condition numbers play an important role in numerical analysis. Classical condition numbers are normwise: they measure the size of both input perturbations and output errors using norms. In this paper, we give explicit, computable expressions depending on the data, for the normwise condition numbers for the computation of the Moore–Penrose inverse as well as for the solutions of linear least‐squares problems with full‐column rank. Copyright © 2007 John Wiley & Sons, Ltd.     

Perturbation Analysis of Moore–Penrose Quasi-linear Projection Generalized Inverse of Closed Linear Operators in Banach Spaces

In this paper, we investigate the perturbation problem for the Moore–Penrose bounded quasi-linear projection generalized inverses of a closed linear operaters in Banach space. By the method of the perturbation analysis of bounded quasi-linear operators, we obtain an explicit perturbation theorem and error estimates for the Moore–Penrose bounded quasi-linear generalized inverse of closed linear operator under the T-bounded perturbation, which not only extend some known results on the perturbation of the oblique projection generalized inverse of closed linear operators, but also extend some known results on the perturbation of the Moore–Penrose metric generalized inverse of bounded linear operators in Banach spaces.     

Further results on generalized inverses of tensors via the Einstein product

The notion of the Moore–Penrose inverse of tensors with the Einstein product was introduced, very recently. In this paper, we further elaborate on this theory by producing a few characterizations of different generalized inverses of tensors. A new method to compute the Moore–Penrose inverse of tensors is proposed. Reverse order laws for several generalized inverses of tensors are also presented. In addition to these, we discuss general solutions of multilinear systems of tensors using such theory.     

Reconstructing unknown nonlinear boundary conditions in a time‐fractional inverse reaction–diffusion–convection problem

This paper has focused on unknown functions identification in nonlinear boundary conditions of an inverse problem of a time‐fractional reaction–diffusion–convection equation. This inverse problem is generally ill‐posed in the sense of stability, that is, the solution of problem does not depend continuously on the input data. Thus, a combination of the mollification regularization method with Gauss kernel and a finite difference marching scheme will be introduced to solve this problem. The generalized cross‐validation choice rule is applied to find a suitable regularization parameter. The stability and convergence of the numerical method are investigated. Finally, two numerical examples are provided to test the effectiveness and validity of the proposed approach.     

A numerical study of the SVD–MFS solution of inverse boundary value problems in two‐dimensional steady‐state linear thermoelasticity

We study the reconstruction of the missing thermal and mechanical data on an inaccessible part of the boundary in the case of two‐dimensional linear isotropic thermoelastic materials from overprescribed noisy measurements taken on the remaining accessible boundary part. This inverse problem is solved by using the method of fundamental solutions together with the method of particular solutions. The stabilization of this inverse problem is achieved using several singular value decomposition (SVD)‐based regularization methods, such as the Tikhonov regularization method (Tikhonov and Arsenin, Methods for solving ill‐posed problems, Nauka, Moscow, 1986), the damped SVD and the truncated SVD (Hansen, Rank‐deficient and discrete ill‐posed problems: numerical aspects of linear inversion, SIAM, Philadelphia, 1998), whilst the optimal regularization parameter is selected according to the discrepancy principle (Morozov, Sov Math Doklady 7 (1966), 414–417), generalized cross‐validation criterion (Golub et al. Technometrics 22 (1979), 1–35) and Hansen's L‐curve method (Hansen and O'Leary, SIAM J Sci Comput 14 (1993), 1487–503). © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 168–201, 2015     

A meshless method based on the dual reciprocity method for one‐dimensional stochastic partial differential equations

This article describes a new meshless method based on the dual reciprocity method (DRM) for the numerical solution of one‐dimensional stochastic heat and advection–diffusion equations. First, the time derivative is approximated by the time–stepping method to transforming the original stochastic partial differential equations (SPDEs) into elliptic SPDEs. The resulting elliptic SPDEs have been approximated with the new method, which is a combination of radial basis functions (RBFs) method and the DRM method. We have used inverse multiquadrics (IMQ) and generalized IMQ (GIMQ) RBFs, to approximate functions in the presented method. The noise term has been approximated at the source points, at each time step. The developed formulation is verified in two test problems with investigating the convergence and accuracy of numerical results. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 292–306, 2016     

B‐spline collocation algorithm for numerical solution of the generalized Burger's‐Huxley equation

The cubic B‐spline collocation scheme is implemented to find numerical solution of the generalized Burger's–Huxley equation. The scheme is based on the finite‐difference formulation for time integration and cubic B‐spline functions for space integration. Convergence of the scheme is discussed through standard convergence analysis. The proposed scheme is of second‐order convergent. The accuracy of the proposed method is demonstrated by four test problems. The numerical results are found to be in good agreement with the exact solutions. Results are compared with other results given in literature. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Removal of blur in images based on least squares solutions

We propose an image restoration method. The method generalizes image restoration algorithms that are based on the Moore–Penrose solution of certain matrix equations that define the linear motion blur. Our approach is based on the usage of least squares solutions of these matrix equations, wherein an arbitrary matrix of appropriate dimensions is included besides the Moore–Penrose inverse. In addition, the method is a useful tool for improving results obtained by other image restoration methods. Toward that direction, we investigate the case where the arbitrary matrix is replaced by the matrix obtained by the Haar basis reconstructed image. The method has been tested by reconstructing an image after the removal of blur caused by the uniform linear motion and filtering the noise that is corrupted with the image pixels. The quality of the restoration is observable by a human eye. Benefits of using the method are illustrated by the values of the improvement in signal‐to‐noise ratio and in the values of peak signal‐to‐noise ratio. Copyright © 2013 John Wiley & Sons, Ltd.     

First‐Order system least squares for generalized‐Newtonian coupled Stokes‐Darcy flow

The coupled problem for a generalized Newtonian Stokes flow in one domain and a generalized Newtonian Darcy flow in a porous medium is studied in this work. Both flows are treated as a first‐order system in a stress‐velocity formulation for the Stokes problem and a volumetric flux‐hydraulic potential formulation for the Darcy problem. The coupling along an interface is done using the well‐known Beavers–Joseph–Saffman interface condition. A least squares finite element method is used for the numerical approximation of the solution. It is shown that under some assumptions on the viscosity the error is bounded from above and below by the least squares functional. An adaptive refinement strategy is examined in several numerical examples where boundary singularities are present. Due to the nonlinearity of the problem a Gauss–Newton method is used to iteratively solve the problem. It is shown that the linear variational problems arising in the Gauss–Newton method are well posed. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1150–1173, 2015     

A generalization of the Bott–Duffin inverse and its applications

The ‘constrained inverse’ was introduced by Bott and Duffin in 1953. Since then various generalizations have arisen. In this paper, we propose a generalization of the Bott–Duffin inverse. Applications of the projection methods for solving sparse linear systems, the truncated methods for solving least squares problems, and solvers for generalized saddle point problems are also presented. The relationships with other generalized Bott–Duffin inverses are explored. The results indicate that the generalized Bott–Duffin inverse may be a useful tool in matrix computations. Copyright © 2008 John Wiley & Sons, Ltd.     

SUPG and grad‐div stabilized finite element methods for steady weakly compressible viscous flow

The extensive application of mathematical and computational methods has become an efficient and powerful approach to the investigation and solution of many problems and processes in fluid dynamics from qualitative as well as quantitative point of view. In this work a new class of advanced numerical approximation schemes to isothermal compressible viscous flow is presented. The schemes are based on an iteration between an Oseen like problem for the velocity and a hyperbolic transport equation for the density. Such schemes seem attractive for computations because they offer a reduction to simpler problems for which highly refined numerical methods either are known or can be built from existing approximation schemes to similar equations, and because of the guidance that can be drawn from an existence theory based on them. For the generalized Oseen subproblem a Taylor–Hood finite element method is proposed that is stabilized by a reduced SUPG and grad‐div technique (cf. [1, 4]) in the convection‐dominated case. Results of theoretical investigations and numerical studies are presented. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the invertibility of the operator A–XB

For a given pair of (A, B) and an arbitrary operator X, expressions for the inverse, the Moore–Penrose inverse and the generalized Drazin inverse of the operator A–XB are derived under some conditions. Copyright © 2009 John Wiley & Sons, Ltd.     

Non‐perturbative solution of three‐dimensional Navier–Stokes equations for the flow near an infinite rotating disk

In this paper, we present Homotopy perturbation method (HPM) and Padé technique, for finding non‐perturbative solution of three‐dimensional viscous flow near an infinite rotating disk. We compared our solution with the numerical solution (fourth‐order Runge–Kutta). The results show that the HPM–Padé technique is an appropriate method in solving the systems of nonlinear equations. The mathematical technique employed in this paper is significant in studying some other problems of engineering. Copyright © 2009 John Wiley & Sons, Ltd.     

Fredholm boundary value problems for perturbed systems of dynamic equations on time scales

This paper offers conditions ensuring the existence of solutions of linear boundary value problems for systems of dynamic equations on time scales. Utilizing a method of Moore–Penrose pseudo‐inverse matrices leads to an analytical form of a criterion for the existence of solutions in a relevant space and, moreover, to the construction of a family of linearly independent solutions of such problems in a general case with the number of boundary conditions (defined by a linear vector functional) not coinciding with the number of unknowns of a system of dynamic equations. As an example of an application of the presented results, the problem of bifurcation of solutions of boundary value problems for systems of dynamic equations on time scales with a small parameter is considered.     

High‐Order Soliton Solution of Landau–Lifshitz Equation

The Landau–Lifshitz equation is analyzed via the inverse scattering method. First, we give the well‐posedness theory for Landau–Lifshitz equation with the frame of inverse scattering method. The generalized Darboux transformation is rigorous considered in the frame of inverse scattering transformation. Finally, we give the high‐order soliton solution formula of Landau–Lifshitz equation and vortex filament equation.     

Numerical solution of nonlinear partial quadratic integro‐differential equations of fractional order via hybrid of block‐pulse and parabolic functions

In this paper, an effective numerical approach based on a new two‐dimensional hybrid of parabolic and block‐pulse functions (2D‐PBPFs) is presented for solving nonlinear partial quadratic integro‐differential equations of fractional order. Our approach is based on 2D‐PBPFs operational matrix method together with the fractional integral operator, described in the Riemann–Liouville sense. The main characteristic behind this approach is to reduce such problems to those of solving systems of algebraic equations, which greatly simplifies the problem. By using Newton's iterative method, this system is solved, and the solution of fractional nonlinear partial quadratic integro‐differential equations is achieved. Convergence analysis and an error estimate associated with the proposed method is obtained, and it is proved that the numerical convergence order of the suggested numerical method is O(h³) . The validity and applicability of the method are demonstrated by solving three numerical examples. Numerical examples are presented in the form of tables and graphs to make comparisons with the exact solutions much easier.     

Direct and iterative methods for interval parametric algebraic systems producing parametric solutions

This paper deals with interval parametric linear systems with general dependencies. Motivated by the so‐called parameterized solution introduced by Kolev, we consider the enclosures of the solution set in a revised affine form. This form is advantageous to a classical interval solution because it enables us to obtain both outer and inner bounds for the parametric solution set and, thus, intervals containing the endpoints of the hull solution, among others. We propose two solution methods, a direct method called the generalized expansion method and an iterative method based on interval‐affine Krawczyk iterations. For the iterative method, we discuss its convergence and show the respective sufficient criterion. For both methods, we perform theoretical and numerical comparisons with some other approaches. The numerical experiments, including also interval parametric linear systems arising in practical problems of structural and electrical engineering, indicate the great usefulness of the proposed methodology and its superiority over most of the existing approaches to solving interval parametric linear systems.     

Computational methods of linear algebra

The authors' survey paper is devoted to the present state of computational methods in linear algebra. Questions discussed are the means and methods of estimating the quality of numerical solution of computational problems, the generalized inverse of a matrix, the solution of systems with rectangular and poorly conditioned matrices, the inverse eigenvalue problem, and more traditional questions such as algebraic eigenvalue problems and the solution of systems with a square matrix (by direct and iterative methods).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 54, pp. 3–228, 1975.     

Analytic perturbation of generalized inverses

We investigate the analytic perturbation of generalized inverses. Firstly we analyze the analytic perturbation of the Drazin generalized inverse (also known as reduced resolvent in operator theory). Our approach is based on spectral theory of linear operators as well as on a new notion of group reduced resolvent. It allows us to treat regular and singular perturbations in a unified framework. We provide an algorithm for computing the coefficients of the Laurent series of the perturbed Drazin generalized inverse. In particular, the regular part coefficients can be efficiently calculated by recursive formulae. Finally we apply the obtained results to the perturbation analysis of the Moore–Penrose generalized inverse in the real domain.