MCD-finite Domains and Ascent of IDF Property in Polynomial Extensions

An integral domain is said to have the IDF property when every non-zero element of it has only a finite number of non-associate irreducible divisors. A counterexample has already been found showing that the IDF property does not necessarily ascend in polynomial extensions. In this paper, we introduce a new class of integral domains, called MCD-finite domains, and show that for any domain D, D[X] is an IDF domain if and only if D is both IDF and MCD-finite. This result entails all the previously known sufficient conditions for the ascent of the IDF property. Our new characterization of polynomial domains with the IDF property enables us to use a different construction and build another counterexample which strengthen the previously known result on this matter.     

On the enumeration of polynomials with prescribed factorization pattern

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of monic n-smooth polynomials of degree m over a finite field, as well as the number of monic n-smooth polynomials of degree m with the prescribed trace coefficient.     

On equilibration and sparse factorization of matrices arising in finite element solutions of partial differential equations

Investigations of scaling and equilibration of general matrices have been traditionally aimed at the effects on the stability and accuracy of LU factorizations—the so‐called scaling problem. Notably, Skeel (1979) concludes that no systematic scaling procedure can be concocted for general matrices exempt from the danger of disastrous effects. Other researchers suggest that scaling procedures are not beneficial and should be abandoned altogether. Stability and accuracy issues notwithstanding, we show that this unglamorous technique has a profound impact on the sparsity of the resulting LU factors. In the modern era of fast computing, equilibration can play a key role in constructing incomplete sparse factorizations to solve a problem unstably, but quickly and iteratively. This article presents practical evidence, on the basis of sparsity, that scaling is an indispensable companion for sparse factorization algorithms when applied to realistic problems of industrial interest. In light of our findings, we conclude that equilibration with the ∞‐norm is superior than equilibration with the 2‐norm. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 11–29, 2000     

An efficient approach to updating simplex multipliers in the simplex algorithm

The simplex algorithm computes the simplex multipliers by solving a system (or two triangular systems) at each iteration. This note offers an efficient approach to updating the simplex multipliers in conjunction with the Bartels–Golub and Forrest–Tomlin updates for LU factors of the basis. It only solves one triangular system. The approach was implemented within and tested against MINOS 5.51 on 129 problems from Netlib, Kennington and BPMPD. Computational results show that the new approach improves simplex implementations. Project 10371017 supported by National Natural Science Foundation of China.     

Prediction of incompressible flow separation with the approximate factorization technique

This paper describes one application of the approximate factorization technique to the solution of incompressible steady viscous flow problems in two dimensions. The velocity-pressure formulation of the Navier-Stokes equations written in curvilinear non-orthogonal co-ordinates is adopted. The continuity equation is replaced with one equation for the pressure by means of the artificial compressibility concept to obtain a system parabolic in time. The resulting equations are discretized in space with centred finite differences, and the steady state solution obtained by a time-marching ADI method requiring to solve 3 x 3 block tridiagonal linear systems. An optimized fourth-order artificial dissipation is introduced to damp the numerical instabilities of the artificial compressibility equation and ensure convergence. The resulting solver is applied to the prediction of a wide variety of internal flows, including both streamlined boundaries and sharp corners, and fast convergence and good results obtained for all the configurations investigated.     

A stable method for solving certain constrained least squares problems

This paper presents a feasible descent algorithm for solving certain constrained least squares problems. These problems are specially structured quadratic programming problems with positive semidefinite Hessian matrices that are allowed to be singular. The algorithm generates a finite sequence of subproblems that are solved using the numerically stable technique of orthogonal factorization with reorthogonalization and Given's transformation updating.This material is based upon work supported by the National Science Foundation under Grant No. MCS 78-06716 and by the International Institute for Applied Systems Analysis.     

A practicable steepest-edge simplex algorithm

It is shown that suitable recurrences may be used in order to implement in practice the steepest-edge simplex linear programming algorithm. In this algorithm each iteration is along an edge of the polytope of feasible solutions on which the objective function decreases most rapidly with respect to distance in the space of all the variables. Results of computer comparisons on medium-scale problems indicate that the resulting algorithm requires less iterations but about the same overall time as the algorithm of Harris [8], which may be regarded as approximating the steepest-edge algorithm. Both show a worthwhile advantage over the standard algorithm.     

Exclusive decay of 1 heavy quarkonium into photon and two pions

We study the exclusive decay of 1⁻⁻ heavy quarkonium into one photon and two pions in the kinematic region, where the two-pion system has a invariant mass which is much smaller than the mass of heavy quarkonium. Neglecting effects suppressed by the inverse of the heavy quark mass, the decay amplitude can be factorized, in which the nonperturbative effect related to heavy quarkonium is represented by a non-relativistic QCD matrix element, and that related to the two pions is represented by a distribution amplitude of two gluons in the isoscalar pion pair. By taking the asymptotic form for the distribution amplitude and by using chiral perturbative theory we are able to obtain numerical predictions for the decay. Numerical results show that the decay of J/ψ can be observed at BEPC and at CESR. Experiment observation of this process in this kinematic region at BEPC and CESR can provide information about how gluons are converted into the two pions and may supply a unique approach to study I=0 s-wave ππ scattering.     

Inherited Fuzzy Interpolation Based on the Inherited Lower-upper Factorization

In this paper, a new scheme is proposed to find the fuzzy interpolation polynomial. In this case, the nodes are crisp data and the values are fuzzy numbers. In order to obtain the interpolation polynomial, a linear system is solved with crisp coefficients matrix and fuzzy right hand side. Then, the inherited lower-upper (LU) triangular factorization and inherited interpolation are applied to solve this system. The examples illustrate the applicability, simplicity and efficiency of the proposed method.