The authors proposed a symplectic stereo-modeling method(SSM)in the Birkhoffian dynam-ics and apply it to the visco-acoustic least-squares reverse time migration(LSRTM).The SSM adopts ste-reo-modeling operator in spac...The authors proposed a symplectic stereo-modeling method(SSM)in the Birkhoffian dynam-ics and apply it to the visco-acoustic least-squares reverse time migration(LSRTM).The SSM adopts ste-reo-modeling operator in space and symplectic Runge-Kutta scheme in time,resulting in great ability in suppressing numerical dispersion and long-time computing.These advantages are further confirmed by numerical dispersion analysis,long-time computation test and computational efficiency comparison.After these theoretical analyses and experiments,acoustic and visco-acoustic LSRTM are tested and compared between SSM method and the conventional symplectic method(CSM)using the fault and marmousi models.Meanwhile,dynamic source encoding and exponential decay moving average gradients method are adopted to reduce the computation cost and improve the convergence rate.The imaging results show that LSRTM based on visco-acoustic wave equations effectively takes into account the influence of viscosity can therefore compensate for the amplitude attenuation.Besides,SSM method not only has high numerical accuracy and computational efficiency,but also performs effectively in LSRTM.展开更多
The full-spectrum least-squares(FSLS) method is introduced to perform quantitative energy-dispersive X-ray fluorescence analysis for unknown solid samples.Based on the conventional least-squares principle, this spectr...The full-spectrum least-squares(FSLS) method is introduced to perform quantitative energy-dispersive X-ray fluorescence analysis for unknown solid samples.Based on the conventional least-squares principle, this spectrum evaluation method is able to obtain the background-corrected and interference-free net peaks, which is significant for quantization analyses. A variety of analytical parameters and functions to describe the features of the fluorescence spectra of pure elements are used and established, such as the mass absorption coefficient, the Gi factor, and fundamental fluorescence formulas. The FSLS iterative program was compiled in the C language. The content of each component should reach the convergence criterion at the end of the calculations. After a basic theory analysis and experimental preparation, 13 national standard soil samples were detected using a spectrometer to test the feasibility of using the algorithm. The results show that the calculated contents of Ti, Fe, Ni, Cu, and Zn have the same changing tendency as the corresponding standard content in the 13 reference samples. Accuracies of 0.35% and 14.03% are obtained, respectively, for Fe and Ti, whose standard concentrations are 8.82% and 0.578%, respectively. However, the calculated results of trace elements (only tens of lg/g) deviate from the standard values. This may be because of measurement accuracy and mutual effects between the elements.展开更多
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 t...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.展开更多
A novel algorithm for source location by utilizing the time difference of arrival (TDOA) measurements of a signal received at spatially separated sensors is proposed. The algorithm is based on quadratic constraint tot...A novel algorithm for source location by utilizing the time difference of arrival (TDOA) measurements of a signal received at spatially separated sensors is proposed. The algorithm is based on quadratic constraint total least-squares (QC-TLS) method and gives an explicit solution. The total least-squares method is a generalized data fitting method that is appropriate for cases when the system model contains error or is not known exactly, and quadratic constraint, which could be realized via Lagrange multipliers technique, could constrain the solution to the location equations to improve location accuracy. Comparisons of performance with ordinary least-squares are made, and Monte Carlo simulations are performed. Simulation results indicate that the proposed algorithm has high location accuracy and achieves accuracy close to the Cramer-Rao lower bound (CRLB) near the small TDOA measurement error region.展开更多
The solution of the grey model(GM(1,1)model)generally involves equal-precision observations,and the(co)variance matrix is established from the prior information.However,the data are generally available with unequal-pr...The solution of the grey model(GM(1,1)model)generally involves equal-precision observations,and the(co)variance matrix is established from the prior information.However,the data are generally available with unequal-precision measurements in reality.To deal with the errors of all observations for GM(1,1)model with errors-in-variables(EIV)structure,we exploit the total least-squares(TLS)algorithm to estimate the parameters of GM(1,1)model in this paper.Ignoring that the effect of the improper prior stochastic model and the homologous observations may degrade the accuracy of parameter estimation,we further present a nonlinear total least-squares variance component estimation approach for GM(1,1)model,which resorts to the minimum norm quadratic unbiased estimation(MINQUE).The practical and simulative experiments indicate that the presented approach has significant merits in improving the predictive accuracy in comparison with control methods.展开更多
This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obt...This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obtained in T = n(log2m + log2(n - r + 1) + 5) + log2m + 1 steps with P=mn processors when m × 2(n - 1) and with P = 2n(n - 1) processors otherwise.展开更多
Necessary and sufficient conditions are derived for some matrix equations that have a common least-squares solution.A general expression is provided when certain resolvable conditions are satisfied.This research exten...Necessary and sufficient conditions are derived for some matrix equations that have a common least-squares solution.A general expression is provided when certain resolvable conditions are satisfied.This research extends existing work in the literature.展开更多
Order-recursive least-squares(ORLS)algorithms are applied to the prob-lems of estimation and identification of FIR or ARMA system parameters where a fixedset of input signal samples is available and the desired order ...Order-recursive least-squares(ORLS)algorithms are applied to the prob-lems of estimation and identification of FIR or ARMA system parameters where a fixedset of input signal samples is available and the desired order of the underlying model isunknown.On the basis of several universal formulae for updating nonsymmetric projec-tion operators,this paper presents three kinds of LS algorithms,called nonsymmetric,symmetric and square root normalized fast ORLS algorithms,respectively.As to the au-thors’ knowledge,the first and the third have not been so far provided,and the second isone of those which have the lowest computational requirement.Several simplified versionsof the algorithms are also considered.展开更多
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 approxi...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.展开更多
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 line...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.展开更多
Estimation of stochastic demand in physical distribution in general and efficient transport routs management in particular is emerging as a crucial factor in urban planning domain. It is particularly important in some...Estimation of stochastic demand in physical distribution in general and efficient transport routs management in particular is emerging as a crucial factor in urban planning domain. It is particularly important in some municipalities such as Tehran where a sound demand management calls for a realistic analysis of the routing system. The methodology involved critically investigating a fuzzy least-squares linear regression approach (FLLRs) to estimate the stochastic demands in the vehicle routing problem (VRP) bearing in mind the customer's preferences order. A FLLR method is proposed in solving the VRP with stochastic demands: approximate-distance fuzzy least-squares (ADFL) estimator ADFL estimator is applied to original data taken from a case study. The SSR values of the ADFL estimator and real demand are obtained and then compared to SSR values of the nominal demand and real demand. Empirical results showed that the proposed method can be viable in solving problems under circumstances of having vague and imprecise performance ratings. The results further proved that application of the ADFL was realistic and efficient estimator to face the sto- chastic demand challenges in vehicle routing system management and solve relevant problems.展开更多
Background:This article investigates the Least-Squares Monte Carlo Method by using different polynomial basis in American Asian Options pricing.The standard approach in the option pricing literature is to choose the b...Background:This article investigates the Least-Squares Monte Carlo Method by using different polynomial basis in American Asian Options pricing.The standard approach in the option pricing literature is to choose the basis arbitrarily.By comparing four different polynomial basis we show that the choice of basis interferes in the option's price.Methods:We assess Least-Squares Method performance in pricing four different American Asian Options by using four polynomial basis:Power,Laguerre,Legendre and Hermite A.To every American Asian Option priced,three sets of parameters are used in order to evaluate it properly.Results:We show that the choice of the basis interferes in the option's price by showing that one of them converges to the option's value faster than any other by using fewer simulated paths.In the case of an Amerasian call option,for example,we find that the preferable polynomial basis is Hermite A.For an Amerasian put option,the Power polynomial basis is recommended.Such empirical outcome is theoretically unpredictable,since in principle all basis can be indistinctly used when pricing the derivative.Conclusion:In this article The Least-Squares Monte Carlo Method performance is assessed in pricing four different types of American Asian Options by using four different polynomial basis through three different sets of parameters.Our results suggest that one polynomial basis is best suited to perform the method when pricing an American Asian option.Theoretically all basis can be indistinctly used when pricing the derivative.However,our results does not confirm these.We find that when pricing an American Asian put option,Power A is better than the other basis we have studied here whereas when pricing an American Asian call,Hermite A is better.展开更多
In this article, some properties of matrices of moving least-squares approximation have been proven. The used technique is based on known inequalities for singular-values of matrices. Some inequalities for the norm of...In this article, some properties of matrices of moving least-squares approximation have been proven. The used technique is based on known inequalities for singular-values of matrices. Some inequalities for the norm of coefficients-vector of the linear approximation have been proven.展开更多
The structure-coupled joint inversion method of gravity and magnetic data is a powerful tool for?developing improved physical property models with high resolution and compatible features;?however, the conventional pro...The structure-coupled joint inversion method of gravity and magnetic data is a powerful tool for?developing improved physical property models with high resolution and compatible features;?however, the conventional procedure is inefficient due to the truncated singular values decomposition?(SVD) process at each iteration. To improve the algorithm, a technique using damped leastsquares?is adopted to calculate the structural term of model updates, instead of the truncated SVD. This?produces structural coupled density and magnetization images with high efficiency. A so-called?coupling factor is introduced to regulate the tuning of the desired final structural similarity level.?Synthetic examples show that the joint inversion results are internally consistent and achieve?higher?resolution than separated. The acceptable runtime performance of the damped least squares?technique used in joint inversion indicates that it is more suitable for practical use than the truncated SVD method.展开更多
Through the real representations of quaternion matrices and matrix rank method, we give the expression of the real ma-trices in least-squares g-inverse and minimum norm g-inverse. From these formulas, we derive the ex...Through the real representations of quaternion matrices and matrix rank method, we give the expression of the real ma-trices in least-squares g-inverse and minimum norm g-inverse. From these formulas, we derive the extreme ranks of the real matrices. As applications, we establish necessary and sufficient conditions for some special least-squares g-inverse and minimum norm g-inverse.展开更多
In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative meth...In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative method, for any initial matrix group within a special constrained matrix set, a least squares solution group with satisfying different linear constraint can be obtained within finite iteration steps in the absence of round off errors, and the unique least norm least-squares solution can be obtained by choosing a special kind of initial matrix group. In addition, a minimization property of this iterative method is characterized. Finally, numerical experiments are reported to show the efficiency of the proposed method.展开更多
A least.squares refinement procedure has been proposed for resolving enantiomorphous am-biguity of noncentrosymmetric structures containing heavy atoms in a centrosymmetric ar-rangement.During the least-squares refine...A least.squares refinement procedure has been proposed for resolving enantiomorphous am-biguity of noncentrosymmetric structures containing heavy atoms in a centrosymmetric ar-rangement.During the least-squares refinement of a pseudo-centrosymmetric image containingboth enantiomorphs,the temperature factors of atoms in one enantiomorph shift in the samedirection,while those of the other shift in the opposite direction.Accordingly the truestructure can be distinguished easily from its enantiomorph.Tests on four unknown struc-tures have shown that the method is very powerful.展开更多
For the second-order finite volume method,implicit schemes and reconstruction methods are two main algorithms which influence the robustness and efficiency of the numerical simulations of compressible turbulent flows....For the second-order finite volume method,implicit schemes and reconstruction methods are two main algorithms which influence the robustness and efficiency of the numerical simulations of compressible turbulent flows.In this paper,a compact least-squares reconstruction method is proposed to calculate the gradients for the distribution of flow field variables approximation.The compactness of the new reconstruction method is reflected in the gradient calculation process.The geometries of the face-neighboring elements are no longer utilized,and the weighted average values at the centroid of the interfaces are used to calculate the gradients instead of the values at the centroid of the face-neighboring elements.Meanwhile,an exact Jacobian solving strategy is developed for implicit temporal discretization.The accurate processing of Jacobian matrix can extensively improve the invertibility of the Jacobian matrix and avoid introducing extra numerical errors.In addition,a modified Venkatakrishnan limiter is applied to deal with the shock which may appear in transonic flows and the applicability of the mentioned methods is enhanced further.The combination of the proposed methods makes the numerical simulations of turbulent flow converge rapidly and steadily with an adaptive increasing CFL number.The numerical results of several benchmarks indicate that the proposed methods perform well in terms of robustness,efficiency and accuracy,and have good application potential in turbulent flow simulations of complex configurations.展开更多
Data fitting is an extensively employed modeling tool in geometric design. With the advent of the big data era, the data sets to be fitted are made larger and larger, leading to more and more least-squares fitting sys...Data fitting is an extensively employed modeling tool in geometric design. With the advent of the big data era, the data sets to be fitted are made larger and larger, leading to more and more least-squares fitting systems with singular coefficient matrices. LSPIA (least-squares progressive iterative approximation) is an efficient iterative method for the least-squares fitting. However, the convergence of LSPIA for the singular least-squares fitting systems remains as an open problem. In this paper, the authors showed that LSPIA for the singular least-squares fitting systems is convergent. Moreover, in a special case, LSPIA converges to the Moore-Penrose (M-P) pseudo-inverse solution to the least- squares fitting result of the data set. This property makes LSPIA, an iterative method with clear geometric meanings, robust in geometric modeling applications. In addition, the authors discussed some implementation detail of LSPIA, and presented an example to validate the convergence of LSPIA for the singular least-squares fitting systems.展开更多
基金Supported by projects of National Natural Science Foundation of China(Nos.41604105,41974114)Fundamental Research Funds for Central Universities(No.2020YQLX01).
文摘The authors proposed a symplectic stereo-modeling method(SSM)in the Birkhoffian dynam-ics and apply it to the visco-acoustic least-squares reverse time migration(LSRTM).The SSM adopts ste-reo-modeling operator in space and symplectic Runge-Kutta scheme in time,resulting in great ability in suppressing numerical dispersion and long-time computing.These advantages are further confirmed by numerical dispersion analysis,long-time computation test and computational efficiency comparison.After these theoretical analyses and experiments,acoustic and visco-acoustic LSRTM are tested and compared between SSM method and the conventional symplectic method(CSM)using the fault and marmousi models.Meanwhile,dynamic source encoding and exponential decay moving average gradients method are adopted to reduce the computation cost and improve the convergence rate.The imaging results show that LSRTM based on visco-acoustic wave equations effectively takes into account the influence of viscosity can therefore compensate for the amplitude attenuation.Besides,SSM method not only has high numerical accuracy and computational efficiency,but also performs effectively in LSRTM.
基金supported by the National Key R&D Project of China(No.2017YFC0602100)the National Natural Science Foundation of China(No.41774147)Sichuan Science and Technology Support Program(No.2015GZ0272)
文摘The full-spectrum least-squares(FSLS) method is introduced to perform quantitative energy-dispersive X-ray fluorescence analysis for unknown solid samples.Based on the conventional least-squares principle, this spectrum evaluation method is able to obtain the background-corrected and interference-free net peaks, which is significant for quantization analyses. A variety of analytical parameters and functions to describe the features of the fluorescence spectra of pure elements are used and established, such as the mass absorption coefficient, the Gi factor, and fundamental fluorescence formulas. The FSLS iterative program was compiled in the C language. The content of each component should reach the convergence criterion at the end of the calculations. After a basic theory analysis and experimental preparation, 13 national standard soil samples were detected using a spectrometer to test the feasibility of using the algorithm. The results show that the calculated contents of Ti, Fe, Ni, Cu, and Zn have the same changing tendency as the corresponding standard content in the 13 reference samples. Accuracies of 0.35% and 14.03% are obtained, respectively, for Fe and Ti, whose standard concentrations are 8.82% and 0.578%, respectively. However, the calculated results of trace elements (only tens of lg/g) deviate from the standard values. This may be because of measurement accuracy and mutual effects between the elements.
文摘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.
文摘A novel algorithm for source location by utilizing the time difference of arrival (TDOA) measurements of a signal received at spatially separated sensors is proposed. The algorithm is based on quadratic constraint total least-squares (QC-TLS) method and gives an explicit solution. The total least-squares method is a generalized data fitting method that is appropriate for cases when the system model contains error or is not known exactly, and quadratic constraint, which could be realized via Lagrange multipliers technique, could constrain the solution to the location equations to improve location accuracy. Comparisons of performance with ordinary least-squares are made, and Monte Carlo simulations are performed. Simulation results indicate that the proposed algorithm has high location accuracy and achieves accuracy close to the Cramer-Rao lower bound (CRLB) near the small TDOA measurement error region.
基金supported by the National Natural Science Foundation of China(No.41874001 and No.41664001)Support Program for Outstanding Youth Talents in Jiangxi Province(No.20162BCB23050)National Key Research and Development Program(No.2016YFB0501405)。
文摘The solution of the grey model(GM(1,1)model)generally involves equal-precision observations,and the(co)variance matrix is established from the prior information.However,the data are generally available with unequal-precision measurements in reality.To deal with the errors of all observations for GM(1,1)model with errors-in-variables(EIV)structure,we exploit the total least-squares(TLS)algorithm to estimate the parameters of GM(1,1)model in this paper.Ignoring that the effect of the improper prior stochastic model and the homologous observations may degrade the accuracy of parameter estimation,we further present a nonlinear total least-squares variance component estimation approach for GM(1,1)model,which resorts to the minimum norm quadratic unbiased estimation(MINQUE).The practical and simulative experiments indicate that the presented approach has significant merits in improving the predictive accuracy in comparison with control methods.
基金This project is supported by the National Natural Science Foundation of China
文摘This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obtained in T = n(log2m + log2(n - r + 1) + 5) + log2m + 1 steps with P=mn processors when m × 2(n - 1) and with P = 2n(n - 1) processors otherwise.
文摘Necessary and sufficient conditions are derived for some matrix equations that have a common least-squares solution.A general expression is provided when certain resolvable conditions are satisfied.This research extends existing work in the literature.
文摘Order-recursive least-squares(ORLS)algorithms are applied to the prob-lems of estimation and identification of FIR or ARMA system parameters where a fixedset of input signal samples is available and the desired order of the underlying model isunknown.On the basis of several universal formulae for updating nonsymmetric projec-tion operators,this paper presents three kinds of LS algorithms,called nonsymmetric,symmetric and square root normalized fast ORLS algorithms,respectively.As to the au-thors’ knowledge,the first and the third have not been so far provided,and the second isone of those which have the lowest computational requirement.Several simplified versionsof the algorithms are also considered.
文摘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.
文摘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.
文摘Estimation of stochastic demand in physical distribution in general and efficient transport routs management in particular is emerging as a crucial factor in urban planning domain. It is particularly important in some municipalities such as Tehran where a sound demand management calls for a realistic analysis of the routing system. The methodology involved critically investigating a fuzzy least-squares linear regression approach (FLLRs) to estimate the stochastic demands in the vehicle routing problem (VRP) bearing in mind the customer's preferences order. A FLLR method is proposed in solving the VRP with stochastic demands: approximate-distance fuzzy least-squares (ADFL) estimator ADFL estimator is applied to original data taken from a case study. The SSR values of the ADFL estimator and real demand are obtained and then compared to SSR values of the nominal demand and real demand. Empirical results showed that the proposed method can be viable in solving problems under circumstances of having vague and imprecise performance ratings. The results further proved that application of the ADFL was realistic and efficient estimator to face the sto- chastic demand challenges in vehicle routing system management and solve relevant problems.
文摘Background:This article investigates the Least-Squares Monte Carlo Method by using different polynomial basis in American Asian Options pricing.The standard approach in the option pricing literature is to choose the basis arbitrarily.By comparing four different polynomial basis we show that the choice of basis interferes in the option's price.Methods:We assess Least-Squares Method performance in pricing four different American Asian Options by using four polynomial basis:Power,Laguerre,Legendre and Hermite A.To every American Asian Option priced,three sets of parameters are used in order to evaluate it properly.Results:We show that the choice of the basis interferes in the option's price by showing that one of them converges to the option's value faster than any other by using fewer simulated paths.In the case of an Amerasian call option,for example,we find that the preferable polynomial basis is Hermite A.For an Amerasian put option,the Power polynomial basis is recommended.Such empirical outcome is theoretically unpredictable,since in principle all basis can be indistinctly used when pricing the derivative.Conclusion:In this article The Least-Squares Monte Carlo Method performance is assessed in pricing four different types of American Asian Options by using four different polynomial basis through three different sets of parameters.Our results suggest that one polynomial basis is best suited to perform the method when pricing an American Asian option.Theoretically all basis can be indistinctly used when pricing the derivative.However,our results does not confirm these.We find that when pricing an American Asian put option,Power A is better than the other basis we have studied here whereas when pricing an American Asian call,Hermite A is better.
文摘In this article, some properties of matrices of moving least-squares approximation have been proven. The used technique is based on known inequalities for singular-values of matrices. Some inequalities for the norm of coefficients-vector of the linear approximation have been proven.
文摘The structure-coupled joint inversion method of gravity and magnetic data is a powerful tool for?developing improved physical property models with high resolution and compatible features;?however, the conventional procedure is inefficient due to the truncated singular values decomposition?(SVD) process at each iteration. To improve the algorithm, a technique using damped leastsquares?is adopted to calculate the structural term of model updates, instead of the truncated SVD. This?produces structural coupled density and magnetization images with high efficiency. A so-called?coupling factor is introduced to regulate the tuning of the desired final structural similarity level.?Synthetic examples show that the joint inversion results are internally consistent and achieve?higher?resolution than separated. The acceptable runtime performance of the damped least squares?technique used in joint inversion indicates that it is more suitable for practical use than the truncated SVD method.
文摘Through the real representations of quaternion matrices and matrix rank method, we give the expression of the real ma-trices in least-squares g-inverse and minimum norm g-inverse. From these formulas, we derive the extreme ranks of the real matrices. As applications, we establish necessary and sufficient conditions for some special least-squares g-inverse and minimum norm g-inverse.
文摘In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative method, for any initial matrix group within a special constrained matrix set, a least squares solution group with satisfying different linear constraint can be obtained within finite iteration steps in the absence of round off errors, and the unique least norm least-squares solution can be obtained by choosing a special kind of initial matrix group. In addition, a minimization property of this iterative method is characterized. Finally, numerical experiments are reported to show the efficiency of the proposed method.
文摘A least.squares refinement procedure has been proposed for resolving enantiomorphous am-biguity of noncentrosymmetric structures containing heavy atoms in a centrosymmetric ar-rangement.During the least-squares refinement of a pseudo-centrosymmetric image containingboth enantiomorphs,the temperature factors of atoms in one enantiomorph shift in the samedirection,while those of the other shift in the opposite direction.Accordingly the truestructure can be distinguished easily from its enantiomorph.Tests on four unknown struc-tures have shown that the method is very powerful.
基金supported by the National Natural Science Foundation of China(Nos.11702329,12102247)the Shanghai Key Lab of Vehicle Aerodynamics and Vehicle Thermal Management Systems,China(No.VATLAB-2021-01)。
文摘For the second-order finite volume method,implicit schemes and reconstruction methods are two main algorithms which influence the robustness and efficiency of the numerical simulations of compressible turbulent flows.In this paper,a compact least-squares reconstruction method is proposed to calculate the gradients for the distribution of flow field variables approximation.The compactness of the new reconstruction method is reflected in the gradient calculation process.The geometries of the face-neighboring elements are no longer utilized,and the weighted average values at the centroid of the interfaces are used to calculate the gradients instead of the values at the centroid of the face-neighboring elements.Meanwhile,an exact Jacobian solving strategy is developed for implicit temporal discretization.The accurate processing of Jacobian matrix can extensively improve the invertibility of the Jacobian matrix and avoid introducing extra numerical errors.In addition,a modified Venkatakrishnan limiter is applied to deal with the shock which may appear in transonic flows and the applicability of the mentioned methods is enhanced further.The combination of the proposed methods makes the numerical simulations of turbulent flow converge rapidly and steadily with an adaptive increasing CFL number.The numerical results of several benchmarks indicate that the proposed methods perform well in terms of robustness,efficiency and accuracy,and have good application potential in turbulent flow simulations of complex configurations.
基金supported by the Natural Science Foundation of China under Grant No.61379072
文摘Data fitting is an extensively employed modeling tool in geometric design. With the advent of the big data era, the data sets to be fitted are made larger and larger, leading to more and more least-squares fitting systems with singular coefficient matrices. LSPIA (least-squares progressive iterative approximation) is an efficient iterative method for the least-squares fitting. However, the convergence of LSPIA for the singular least-squares fitting systems remains as an open problem. In this paper, the authors showed that LSPIA for the singular least-squares fitting systems is convergent. Moreover, in a special case, LSPIA converges to the Moore-Penrose (M-P) pseudo-inverse solution to the least- squares fitting result of the data set. This property makes LSPIA, an iterative method with clear geometric meanings, robust in geometric modeling applications. In addition, the authors discussed some implementation detail of LSPIA, and presented an example to validate the convergence of LSPIA for the singular least-squares fitting systems.
