Comparative Study of Probabilistic and Least-Squares Methods for Developing Predictive Models

This article explores the comparison between the probability method and the least squares method in the design of linear predictive models. It points out that these two approaches have distinct theoretical foundations and can lead to varied or similar results in terms of precision and performance under certain assumptions. The article underlines the importance of comparing these two approaches to choose the one best suited to the context, available data and modeling objectives.

Numerical Simulation of Oil-Water Two-Phase Flow in Low Permeability Tight Reservoirs Based on Weighted Least Squares Meshless Method

In response to the complex characteristics of actual low-permeability tight reservoirs,this study develops a meshless-based numerical simulation method for oil-water two-phase flow in these reservoirs,considering complex boundary shapes.Utilizing radial basis function point interpolation,the method approximates shape functions for unknown functions within the nodal influence domain.The shape functions constructed by the aforementioned meshless interpolation method haveδ-function properties,which facilitate the handling of essential aspects like the controlled bottom-hole flow pressure in horizontal wells.Moreover,the meshless method offers greater flexibility and freedom compared to grid cell discretization,making it simpler to discretize complex geometries.A variational principle for the flow control equation group is introduced using a weighted least squares meshless method,and the pressure distribution is solved implicitly.Example results demonstrate that the computational outcomes of the meshless point cloud model,which has a relatively small degree of freedom,are in close agreement with those of the Discrete Fracture Model(DFM)employing refined grid partitioning,with pressure calculation accuracy exceeding 98.2%.Compared to high-resolution grid-based computational methods,the meshless method can achieve a better balance between computational efficiency and accuracy.Additionally,the impact of fracture half-length on the productivity of horizontal wells is discussed.The results indicate that increasing the fracture half-length is an effective strategy for enhancing production from the perspective of cumulative oil production.

Application of neural network model coupling with the partial least-squares method for forecasting watre yield of mine

Scientific forecasting water yield of mine is of great significance to the safety production of mine and the colligated using of water resources. The paper established the forecasting model for water yield of mine, combining neural network with the partial least square method. Dealt with independent variables by the partial least square method, it can not only solve the relationship between independent variables but also reduce the input dimensions in neural network model, and then use the neural network which can solve the non-linear problem better. The result of an example shows that the prediction has higher precision in forecasting and fitting.

LEAST-SQUARES METHOD-BASED FEATURE FITTING AND EXTRACTION IN REVERSE ENGINEERING

The main purpose of reverse engineering is to convert discrete data pointsinto piecewise smooth, continuous surface models. Before carrying out model reconstruction it issignificant to extract geometric features because the quality of modeling greatly depends on therepresentation of features. Some fitting techniques of natural quadric surfaces with least-squaresmethod are described. And these techniques can be directly used to extract quadric surfaces featuresduring the process of segmentation for point cloud.

ON THE BREAKDOWNS OF THE GALERKIN AND LEAST-SQUARES METHODS

The Galerkin and least-squares methods are two classes of the most popular Krylov subspace methOds for solving large linear systems of equations. Unfortunately, both the methods may suffer from serious breakdowns of the same type: In a breakdown situation the Galerkin method is unable to calculate an approximate solution, while the least-squares method, although does not really break down, is unsucessful in reducing the norm of its residual. In this paper we first establish a unified theorem which gives a relationship between breakdowns in the two methods. We further illustrate theoretically and experimentally that if the coefficient matrix of a lienar system is of high defectiveness with the associated eigenvalues less than 1, then the restarted Galerkin and least-squares methods will be in great risks of complete breakdowns. It appears that our findings may help to understand phenomena observed practically and to derive treatments for breakdowns of this type.

Solution of shallow-water equations using least-squares finite-element method

A least-squares finite-element method （LSFEM） for the non-conservative shallow-water equations is presented. The model is capable of handling complex topography, steady and unsteady flows, subcritical and supercritical flows, and flows with smooth and sharp gradient changes. Advantages of the model include： （1） sources terms, such as the bottom slope, surface stresses and bed frictions, can be treated easily without any special treatment; （2） upwind scheme is no needed; （3） a single approximating space can be used for all variables, and its choice of approximating space is not subject to the Ladyzhenskaya-Babuska-Brezzi （LBB） condition; and （4） the resulting system of equations is symmetric and positive-definite （SPD） which can be solved efficiently with the preconditioned conjugate gradient method. The model is verified with flow over a bump, tide induced flow, and dam-break. Computed results are compared with analytic solutions or other numerical results, and show the model is conservative and accurate. The model is then used to simulate flow past a circular cylinder. Important flow charac-teristics, such as variation of water surface around the cylinder and vortex shedding behind the cylinder are investigated. Computed results compare well with experiment data and other numerical results.

NEGATIVE NORM LEAST-SQUARES METHODS FOR THE INCOMPRESSIBLE MAGNETOHYDRODYNAMIC EQUATIONS

The purpose of this article is to develop and analyze least-squares approximations for the incompressible magnetohydrodynamic equations. The major advantage of the least-squares finite element method is that it is not subjected to the so-called Ladyzhenskaya-Babuska-Brezzi （LBB） condition. The authors employ least-squares functionals which involve a discrete inner product which is related to the inner product in H^-1（Ω）.

Least-squares finite-element method for shallow-water equations with source terms

Numerical solution of shallow-water equations （SWE） has been a challenging task because of its nonlinear hyperbolic nature, admitting discontinuous solution, and the need to satisfy the C-property. The presence of source terms in momentum equations, such as the bottom slope and friction of bed, compounds the difficulties further. In this paper, a least-squares finite-element method for the space discretization and θ-method for the time integration is developed for the 2D non-conservative SWE including the source terms. Advantages of the method include： the source terms can be approximated easily with interpolation functions, no upwind scheme is needed, as well as the resulting system equations is symmetric and positive-definite, therefore, can be solved efficiently with the conjugate gradient method. The method is applied to steady and unsteady flows, subcritical and transcritical flow over a bump, 1D and 2D circular dam-break, wave past a circular cylinder, as well as wave past a hump. Computed results show good C-property, conservation property and compare well with exact solutions and other numerical results for flows with weak and mild gradient changes, but lead to inaccurate predictions for flows with strong gradient changes and discontinuities.

Distributed Least-Squares Iterative Methods in Large-Scale Networks:A Survey

Many science and engineering applications involve solvinga linear least-squares system formed from some field measurements. In the distributed cyber-physical systems(CPS),each sensor node used for measurement often only knowspartial independent rows of the least-squares system. To solve the least-squares all the measurements must be gathered at a centralized location and then perform the computa-tion. Such data collection and computation are inefficient because of bandwidth and time constraints and sometimes areinfeasible because of data privacy concerns. Iterative methods are natural candidates for solving the aforementionedproblem and there are many studies regarding this. However,most of the proposed solutions are related to centralized/parallel computations while only a few have the potential to beapplied in distributed networks. Thus distributed computations are strongly preferred or demanded in many of the realworld applications, e.g. smart-grid, target tracking, etc. Thispaper surveys the representative iterative methods for distributed least-squares in networks.

An Adaptive Least-Squares Mixed Finite Element Method for Fourth Order Parabolic Problems

A least-squares mixed finite element (LSMFE) method for the numerical solution of fourth order parabolic problems analyzed and developed in this paper. The Ciarlet-Raviart mixed finite element space is used to approximate. The a posteriori error estimator which is needed in the adaptive refinement algorithm is proposed. The local evaluation of the least-squares functional serves as a posteriori error estimator. The posteriori errors are effectively estimated. The convergence of the adaptive least-squares mixed finite element method is proved.

LEAST-SQUARES MIXED FINITE ELEMENT METHOD FOR A CLASS OF STOKES EQUATION

A least-squares mixed finite element method was formulated for a class of Stokes equations in two dimensional domains. The steady state and the time-dependent Stokes' equations were considered. For the stationary equation, optimal H-t and L-2-error estimates are derived under the standard regularity assumption on the finite element partition ( the LBB-condition is not required). Far the evolutionary equation, optimal L-2 estimates are derived under the conventional Raviart-Thomas spaces.

Least-Squares Finite Element Method for the Steady Upper-Convected Maxwell Fluid

In this paper, a least-squares finite element method for the upper-convected Maxell (UCM) fluid is proposed. We first linearize the constitutive and momentum equations and then apply a least-squares method to the linearized version of the viscoelastic UCM model. The L2 least-squares functional involves the residuals of each equation multiplied by proper weights. The corresponding homogeneous functional is equivalent to a natural norm. The error estimates of the finite element solution are analyzed when the conforming piecewise polynomial elements are used for the unknowns.

Least-Squares及Galerkin谱元方法求解环形区域内的泊松方程

为研究基于Least-Squares变分及Galerkin变分两种形式的谱元方法的求解特性,推导了极坐标系中采用两种变分方法求解环形区域内Poisson方程时对应的弱解形式,采用Chebyshev多项式构造插值基函数进行空间离散,得到两种谱元方法对应的代数方程组,由此分析了系数矩阵结构的特点。数值计算结果显示:Least-Squares谱元方法为实现方程的降阶而引入新的求解变量,使得代数方程组形式更为复杂,但边界条件的处理比Galerkin谱元方法更为简单;两种谱元方法均能求解极坐标系中的Poisson方程且能获得高精度的数值解,二者绝对误差分布基本一致;固定单元内的插值阶数时,增加单元数可减小数值误差,且表现出代数精度的特点,误差降低速度较慢,而固定单元数时,在一定范围内数值误差随插值阶数的增加而减小的速度更快,表现出谱精度的特点;单元内插值阶数较高时,代数方程组系数矩阵的条件数急剧增多,方程组呈现病态,数值误差增大,这一特点限制了单元内插值阶数的取值。研究内容对深入了解两种谱元方法在极坐标系中求解Poisson方程时的特点、进一步采用相关分裂算法求解实际流动问题具有参考价值。

Parameter identification and pressure control of dynamic system in shield tunneling using least squares method

An estimation approach using least squares method was presented for identificationof model parameters of pressure control in shield tunneling.The state equation ofthe pressure control system for shield tunneling was analytically derived based on themass equilibrium principle that the entry mass of the pressure chamber from cutting headwas equal to excluding mass from the screw conveyor.The randomly observed noise wasnumerically simulated and mixed to simulated observation values of system responses.The numerical simulation shows that the state equation of the pressure control system forshield tunneling is reasonable and the proposed estimation approach is effective even ifthe random observation noise exists.The robustness of the controlling procedure is validatedby numerical simulation results.

Least square method based on Haar wavelet to solve multi-dimensional stochastic Ito-Volterra integral equations

This paper proposes a method combining blue the Haar wavelet and the least square to solve the multi-dimensional stochastic Ito-Volterra integral equation.This approach is to transform stochastic integral equations into a system of algebraic equations.Meanwhile,the error analysis is proven.Finally,the effectiveness of the approach is verified by two numerical examples.

Preconditioned iterative methods for solving weighted linear least squares problems

A class of preconditioned iterative methods, i.e., preconditioned generalized accelerated overrelaxation （GAOR） methods, is proposed to solve linear systems based on a class of weighted linear least squares problems. The convergence and comparison results are obtained. The comparison results show that the convergence rate of the preconditioned iterative methods is better than that of the original methods. Furthermore, the effectiveness of the proposed methods is shown in the numerical experiment.

Penalized total least squares method for dealing with systematic errors in partial EIV model and its precision estimation

When the total least squares(TLS)solution is used to solve the parameters in the errors-in-variables(EIV)model,the obtained parameter estimations will be unreliable in the observations containing systematic errors.To solve this problem,we propose to add the nonparametric part(systematic errors)to the partial EIV model,and build the partial EIV model to weaken the influence of systematic errors.Then,having rewritten the model as a nonlinear model,we derive the formula of parameter estimations based on the penalized total least squares criterion.Furthermore,based on the second-order approximation method of precision estimation,we derive the second-order bias and covariance of parameter estimations and calculate the mean square error(MSE).Aiming at the selection of the smoothing factor,we propose to use the U curve method.The experiments show that the proposed method can mitigate the influence of systematic errors to a certain extent compared with the traditional method and get more reliable parameter estimations and its precision information,which validates the feasibility and effectiveness of the proposed method.

Stability of the MGS-like elimination method for equality constrained least squares problems

This paper proves that the weighting method via modified Gram-Schmidt（MGS） for solving the equality constrained least squares problem in the limit is equivalent to the direct elimination method via MGS（MGS-elimination method）. By virtue of this equivalence, the backward and forward roundoff error analysis of the MGS-elimination method is proved. Numerical experiments are provided to verify the results.

Least Squares Method from the View Point of Deep Learning

The least squares method is one of the most fundamental methods in Statistics to estimate correlations among various data. On the other hand, Deep Learning is the heart of Artificial Intelligence and it is a learning method based on the least squares. In this paper we reconsider the least squares method from the view point of Deep Learning and we carry out the computation thoroughly for the gradient descent sequence in a very simple setting. Depending on the values of the learning rate, an essential parameter of Deep Learning, the least squares methods of Statistics and Deep Learning reveal an interesting difference.

Least Squares Method from the View Point of Deep Learning II: Generalization

The least squares method is one of the most fundamental methods in Statistics to estimate correlations among various data. On the other hand, Deep Learning is the heart of Artificial Intelligence and it is a learning method based on the least squares method, in which a parameter called learning rate plays an important role. It is in general very hard to determine its value. In this paper we generalize the preceding paper [K. Fujii: Least squares method from the view point of Deep Learning: Advances in Pure Mathematics, 8, 485-493, 2018] and give an admissible value of the learning rate, which is easily obtained.