THE WEIGHTED KATO SQUARE ROOT PROBLEMOF ELLIPTIC OPERATORS HAVING A BMOANTI-SYMMETRICPART

Let n≥2 and let L be a second-order elliptic operator of divergence form with coefficients consisting of both an elliptic symmetric part and a BMO anti-symmetric part in ℝ^(n).In this article,we consider the weighted Kato square root problem for L.More precisely,we prove that the square root L^(1/2)satisfies the weighted L^(p)estimates||L^(1/2)(f)||L_(ω)^p(R^(n))≤C||■f||L_(ω)^p(R^(n);R^(n))for any p∈(1,∞)andω∈Ap(ℝ^(n))(the class of Muckenhoupt weights),and that||■f||L_(ω)^p(R^(n);R^(n))≤C||L^(1/2)(f)||L_(ω)^p(R^(n))for any p∈(1,2+ε)andω∈Ap(ℝ^(n))∩RH_(2+ε/p),(R^(n))(the class of reverse Hölder weights),whereε∈(0,∞)is a constant depending only on n and the operator L,and where(2+ε/p)'denotes the Hölder conjugate exponent of 2+ε/p.Moreover,for any given q∈(2,∞),we give a sufficient condition to obtain that||■f||L_(ω)^p(R^(n);R^(n))≤C||L^(1/2)(f)||L_(ω)^p(R^(n))for any p∈(1,q)andω∈A_(p)(R^(n))∩pRH_(q/p),(R^(n)).As an application,we prove that when the coefficient matrix A that appears in L satisfies the small BMO condition,the Riesz transform∇L^(−1/2)is bounded on L_(ω)^(p)(ℝ^(n))for any given p∈(1,∞)andω∈Ap(ℝ^(n)).Furthermore,applications to the weighted L^(2)-regularity problem with the Dirichlet or the Neumann boundary condition are also given.

An iterative algorithm for solving ill-conditioned linear least squares problems

Linear Least Squares（LLS） problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics and geosciences, where regularization algorithms are employed to seek optimal solutions. For many problems, even with the use of regularization algorithms it may be impossible to obtain an accurate solution. Riley and Golub suggested an iterative scheme for solving LLS problems. For the early iteration algorithm, it is difficult to improve the well-conditioned perturbed matrix and accelerate the convergence at the same time. Aiming at this problem, self-adaptive iteration algorithm（SAIA） is proposed in this paper for solving severe ill-conditioned LLS problems. The algorithm is different from other popular algorithms proposed in recent references. It avoids matrix inverse by using Cholesky decomposition, and tunes the perturbation parameter according to the rate of residual error decline in the iterative process. Example shows that the algorithm can greatly reduce iteration times, accelerate the convergence,and also greatly enhance the computation accuracy.

Unknown parameter’s variance-covariance propagation and calculation in generalized nonlinear least squares problem

The unknown parameter’s variance-covariance propagation and calculation in the generalized nonlinear least squares remain to be studied now, which didn’t appear in the internal and external referencing documents. The unknown parameter’s vari- ance-covariance propagation formula, considering the two-power terms, was concluded used to evaluate the accuracy of unknown parameter estimators in the generalized nonlinear least squares problem. It is a new variance-covariance formula and opens up a new way to evaluate the accuracy when processing data which have the multi-source, multi-dimensional, multi-type, multi-time-state, different accuracy and nonlinearity.

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.

A meshless algorithm with moving least square approximations for elliptic Signorini problems

Based on the moving least square （MLS） approximations and the boundary integral equations （BIEs）, a meshless algorithm is presented in this paper for elliptic Signorini problems. In the algorithm, a projection operator is used to tackle the nonlinear boundary inequality conditions. The Signorini problem is then reformulated as BIEs and the unknown boundary variables are approximated by the MLS approximations. Accordingly, only a nodal data structure on the boundary of a domain is required. The convergence of the algorithm is proven. Numerical examples are given to show the high convergence rate and high computational efficiency of the presented algorithm.

SPECTRAL PROPERTIES OF DISCRETE STURM-LIOUVILLE PROBLEMS WITH TWO SQUARED EIGENPARAMETER-DEPENDENT BOUNDARY CONDITIONS

In this article,we consider a discrete right-definite Sturm-Liouville problems with two squared eigenparameter-dependent boundary conditions.By constructing some new Lagrange-type identities and two fundamental functions,we obtain not only the existence,the simplicity,and the interlacing properties of the real eigenvalues,but also the oscillation properties,orthogonality of the eigenfunctions,and the expansion theorem.Finally,we also give a computation scheme for computing eigenvalues and eigenfunctions of specific eigenvalue problems.

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.

The least squares problem of the matrix equation A_1X_1B_1~T+A_2X_2B_2~T=T

The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2B2^T - T｜｜F can also be regarded as the constrained LS problem minx=diag（x1,x2） ｜｜AXB^T -T｜｜F with A = [A1, A2] and B = [B1, B2]. The authors transform T to T such that min x1,x2 ｜｜A1X1B1^T＋A2X2B2^T -T｜｜F is equivalent to min x=diag（x1 ,x2） ｜｜AXB^T - T｜｜F whose solutions are included in the solution set of unconstrained problem minx ｜｜AXB^T - T｜｜F. So the general solutions of min x1,x2 ｜｜A1X1B^T ＋ A2X2B2^T -T｜｜F are reconstructed by selecting the parameter matrix in that of minx ｜｜AXB^T - T｜｜F.

Adaptive mixed least squares Galerkin/Petrov finite element method for stationary conduction convection problems

An adaptive mixed least squares Galerkin/Petrov finite element method （FEM） is developed for stationary conduction convection problems. The mixed least squares Galerkin/Petrov FEM is consistent and stable for any combination of discrete velocity and pressure spaces without requiring the Babuska-Brezzi stability condition. Using the general theory of Verfiirth, the posteriori error estimates of the residual type are derived. Finally, numerical tests are presented to illustrate the effectiveness of the method.

Alternate Broyden's Method for Solving Linear Least Squares Problem with Multiple Right-Hand Sides

In this paper, we extend the alternate Broyden's method to the multiple version fbi solving lincar leastsquarc systems with multiple right-hand sides. We show that the method possesses property of a finite tcrmination.Some numerical cxperiments are gi von to inustrate the effectiveness of the method.

Variations of Enclosing Problem Using Axis Parallel Square(s): A General Approach

Let P be a set of n?points in two dimensional plane. For each point , we locate an axis- parallel unit square having one particular side passing through p and enclosing the maximum number of points from P. Considering all points , such n?squares can be reported in O(nlogn)?time. We show that this result can be used to (i) locate m>(2)?axis-parallel unit squares which are pairwise disjoint and they together enclose the maximum number of points from P (if exists) and (ii) find the smallest axis-parallel square enclosing at least k points of P , .

Perturbation Analysis of Structured Least Squares Problems and Its Application in Calibration of Interest Rate Term Structure

A structured perturbation analysis of the least squares problem is considered in this paper.The new error bound proves to be sharper than that for general perturbations. We apply the new error bound to study sensitivity of changing the knots for curve fitting of interest rate term structure by cubic spline.Numerical experiments are given to illustrate the sharpness of this bound.

A Radial Basis Function Method with Improved Accuracy for Fourth Order Boundary Value Problems

Accurately approximating higher order derivatives is an inherently difficult problem. It is shown that a random variable shape parameter strategy can improve the accuracy of approximating higher order derivatives with Radial Basis Function methods. The method is used to solve fourth order boundary value problems. The use and location of ghost points are examined in order to enforce the extra boundary conditions that are necessary to make a fourth-order problem well posed. The use of ghost points versus solving an overdetermined linear system via least squares is studied. For a general fourth-order boundary value problem, the recommended approach is to either use one of two novel sets of ghost centers introduced here or else to use a least squares approach. When using either ghost centers or least squares, the random variable shape parameter strategy results in significantly better accuracy than when a constant shape parameter is used.

Numerical Solution of Mean-Square Approximation Problem of Real Nonnegative Function by the Modulus of Double Fourier Integral

A nonlinear problem of mean-square approximation of a real nonnegative continuous function with respect to two variables by the modulus of double Fourier integral dependent on two real parameters with use of the smoothing functional is studied. Finding the optimal solutions of this problem is reduced to solution of the Hammerstein type two-dimensional nonlinear integral equation. The numerical algorithms to find the branching lines and branching-off solutions of this equation are constructed and justified. Numerical examples are presented.

Fuzzy Least-Squares Linear Regression Approach to Ascertain Stochastic Demand in the Vehicle Routing Problem

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.

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.

关于square-full数上的函数q_k^((e))(n)的均值估计

本文研究了指数k-free数的特征函数q_k^((e))(n)(k≥3)在square-full数集中的均值估计问题.利用黎曼Zeta函数的性质以及留数定理,获得了该均值的渐近公式,推广了q_k^((e))(n)在整数集中的均值估计相关结果.

Neural Network inverse Adaptive Controller Based on Davidon Least Square

General neural network inverse adaptive controller has two flaws: the first is the slow convergence speed; the second is the invalidation to the non-minimum phase system. These defects limit the scope in which the neural network inverse adaptive controller is used. We employ Davidon least squares in training the multi-layer feedforward neural network used in approximating the inverse model of plant to expedite the convergence, and then through constructing the pseudo-plant, a neural network inverse adaptive controller is put forward which is still effective to the nonlinear non-minimum phase system. The simulation results show the validity of this scheme.

FINITE WORDLENGTH ANALYZING FOR RLS SYSTOLIC ALGORITHM BASED ON THE SQUARE-ROOT-FREE SCALED GIVENS ROTATIONS

The least squares(LS) minimization problem constitutes the core of many real-time signal processing problems. A square-root-free scaled Givens rotations algorithm and its systolic architecture for the optimal RLS residual evaluation are presented in this paper. We analyze upper bounds of the dynamic range of processing cells and the internal parameters. Thus the wordlength can be obtained to prevent overflow and to ensure correct operations. Simulation results confirm the theoretical conclusions and the stability of the algorithm.