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.

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.

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.

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 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.

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.

A NONMONOTONE TRUST REGION METHOD FOR NONLINEAR LEAST SQUARES PROBLEMS

In this paper we present a nonmonotone trust region method for nonlinear least squares problems with zero-residual and prove its convergence properties. The extensive numerical results are reported which show that the nonmonotone trust region method is generally superior to the usual trust region method.

EXTENDED OBLIQUE PROJECTION METHOD FOR GENERALIZED LEAST SQUARES PROBLEM

We extend the oblique projection method given by Y.Saad to solve the generalized least squares problem. The corresponding oblique projection operator is presented and the convergence theorems are proved. Some necessary and sufficient conditions for computing the solution or the minimum N-norm solution of the min || A x- b ||M2 have been proposed as well.

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.

Galerkin-Petrov least squares mixed element method for stationary incompressible magnetohydrodynamics

The Galerkin-Petrov least squares method is combined with the mixed finite element method to deal with the stationary, incompressible magnetohydrodynamics system of equations with viscosity. A Galerkin-Petrov least squares mixed finite element format for the stationary incompressible magnetohydrodynamics equations is presented. And the existence and error estimates of its solution are derived. Through this method, the combination among the mixed finite element spaces does not demand the discrete Babuska-Brezzi stability conditions so that the mixed finite element spaces could be chosen arbitrartily and the error estimates with optimal order could be obtained.

A NONLINEAR GALERKIN/PETROV-LEAST SQUARES MIXED ELEMENT METHOD FOR THE STATIONARY NAVIER-STOKES EQUATIONS

A nonlinear Galerkin/Petrov-least squares mixed element (NGPLSME) method for the stationary Navier-Stokes equations is presented and analyzed. The scheme is that Petrov-least squares forms of residuals are added to the nonlinear Galerkin mixed element method so that it is stable for any combination of discrete velocity and pressure spaces without requiring the Babu*lka-Brezzi stability condition. The existence, uniqueness and convergence (at optimal rate) of the NGPLSME solution is proved in the case of sufficient viscosity (or small data).

Low-complexity signal detection for massive MIMO systems via trace iterative method

Linear minimum mean square error(MMSE)detection has been shown to achieve near-optimal performance for massive multiple-input multiple-output(MIMO)systems but inevitably involves complicated matrix inversion,which entails high complexity.To avoid the exact matrix inversion,a considerable number of implicit and explicit approximate matrix inversion based detection methods is proposed.By combining the advantages of both the explicit and the implicit matrix inversion,this paper introduces a new low-complexity signal detection algorithm.Firstly,the relationship between implicit and explicit techniques is analyzed.Then,an enhanced Newton iteration method is introduced to realize an approximate MMSE detection for massive MIMO uplink systems.The proposed improved Newton iteration significantly reduces the complexity of conventional Newton iteration.However,its complexity is still high for higher iterations.Thus,it is applied only for first two iterations.For subsequent iterations,we propose a novel trace iterative method(TIM)based low-complexity algorithm,which has significantly lower complexity than higher Newton iterations.Convergence guarantees of the proposed detector are also provided.Numerical simulations verify that the proposed detector exhibits significant performance enhancement over recently reported iterative detectors and achieves close-to-MMSE performance while retaining the low-complexity advantage for systems with hundreds of antennas.

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.

ALGEBRAIC OPERATION OF SPECIAL MATRICES RELATED TO METHOD OF LEAST SQUARES

The following situation in using the method of least squares to solve problems often occurs.After m experiments completed and a solution of least squares obtained,the ( m+1 ) th experiment is made further in order to improve the results.A method of algebraic operation of special matrices involved in the problem is given in this paper for obtaining a new solution for the m +1 experiments based upon the old solution for the primary m experiments. This method is valid for more general matrices.

Multi-Branch Fault Line Location Method Based on Time Difference Matrix Fitting

The distribution network exhibits complex structural characteristics,which makes fault localization a challenging task.Especially when a branch of the multi-branch distribution network fails,the traditional multi-branch fault location algorithm makes it difficult to meet the demands of high-precision fault localization in the multi-branch distribution network system.In this paper,the multi-branch mainline is decomposed into single branch lines,transforming the complex multi-branch fault location problem into a double-ended fault location problem.Based on the different transmission characteristics of the fault-traveling wave in fault lines and non-fault lines,the endpoint reference time difference matrix S and the fault time difference matrix G were established.The time variation rule of the fault-traveling wave arriving at each endpoint before and after a fault was comprehensively utilized.To realize the fault segment location,the least square method was introduced.It was used to find the first-order fitting relation that satisfies the matching relationship between the corresponding row vector and the first-order function in the two matrices,to realize the fault segment location.Then,the time difference matrix is used to determine the traveling wave velocity,which,combined with the double-ended traveling wave location,enables accurate fault location.