Multilevel preconditioners for a quadrature Galerkin solution of a biharmonic problem

Efficient multilevel preconditioners are developed and analyzed for the quadrature finite element Galerkin approximation of the biharmonic Dirichlet problem. The quadrature scheme is formulated using the Bogner–Fox–Schmit rectangular element and the product two‐point Gaussian quadrature. The proposed additive and multiplicative preconditioners are uniformly spectrally equivalent to the operator of the quadrature scheme. The preconditioners are implemented by optimal algorithms, and they are used to accelerate convergence of the preconditioned conjugate gradient method. Numerical results are presented demonstrating efficiency of the preconditioners. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006     

Cochran's statistical theorem for outer inverses of matrices and matrix quadratic forms

We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures.     

Minimum energy configurations on a toric lattice as a quadratic assignment problem

We consider three known bounds for the quadratic assignment problem (QAP): an eigenvalue, a convex quadratic programming (CQP), and a semidefinite programming (SDP) bound. Since the last two bounds were not compared directly before, we prove that the SDP bound is stronger than the CQP bound. We then apply these to improve known bounds on a discrete energy minimization problem, reformulated as a QAP, which aims to minimize the potential energy between repulsive particles on a toric grid. Thus we are able to prove optimality for several configurations of particles and grid sizes, complementing earlier results by Bouman et al. (2013). The semidefinite programs in question are too large to solve without pre-processing, and we use a symmetry reduction method by Permenter and Parrilo (2020) to make computation of the SDP bounds possible.     

Accurate electrical and spectroscopic properties ofX 1Σ+ BeO from coupled-cluster methods

Summary This paper reports a series of coupled-cluster (CC) calculations through CCSDT on the theoretically challenging ground state of the BeO molecule. Along with CC methods, quadratic configuration interaction (QCI) approximations to CC theory have been used (QCISD and QCISD(T)), which show several dramatic failings. Equilibrium electrical properties (, _xx , and _zz ) and basic spectroscopic properties (r _e, _e,D _e, and infrared intensity (I)) have been computed. Basis set and electron correlation effects are analyzed in order to arrive at accurate values of the dipole moment and polarizability, which are not known experimentally. For the dipole moment, we obtain a value of 6.25 D, with an uncertainty of about 0.1 D. For _xx and _zz , we suggest respective values of 32 and 36 atomic units (a.u.) and error bars of about 1 and 2 a.u. With extended basis sets, the spectroscopic propertiesr _e, _e, andD _e are reproduced to high accuracy, which is the first time this has been achieved for this species byab initio methods. At the highest calculation levels,I is predicted to be very small. AlthoughI has not been measured, some support for this prediction comes from a recent infrared study of BeO-rare gas complexes. The QCI methods are shown to be much more sensitive to basis set, and even with large basis sets yield values of _zz andI which differ from CC results by an order of magnitude and three orders of magnitude, respectively. These differences doubtless arise from the importance of single excitations (T ₁) for this molecule, as several terms involvingT ₁ are neglected in the QCISD approximation compared with CCSD. We also report CC calculations with Brueckner orbitals, which yield results similar to those obtained with restricted Hartree-Fock orbitals.     

On a class of least-element complementarity problems

The present paper studies the linear complementarity problem of finding vectorsx andy inR ₊ ⁿ such thatc + Dx + y 0,b – x 0 andx ^T (c + Dx + y) = y ^T (b – x) = 0 whereD is aZ-matrix andb > 0. Complementarity problems of this nature arise, for example, from the minimization of certain quadratic functions subject to upper and lower bounds on the variables. Two least-element characterizations of solutions to the above linear complementarity problem are established first. Next, a new and direct method to solve this class of problems, which depends on the idea of least-element solution is presented. Finally, applications and computational experience with its implementation are discussed.Research partially supported by the National Science Foundation Grant MCS 71-03341 A04 and the Air Force Office of Scientific Research Contract F 44620 14 C 0079.     

非等距三次样条(Ⅰ)型插值函数余项渐近展开

摘要本文利用基样条插值方法,给出非等距I型三次样条插值误差的余项渐近展开式,推广了文献[1]中的结果。     

Some proximity and sensitivity results in quadratic integer programming

We show that for any optimal solution for a given separable quadratic integer programming problem there exist an optimal solution for its continuous relaxation such that wheren is the number of variables and(A) is the largest absolute subdeterminant of the integer constraint matrixA. Also for any feasible solutionz, which is not optimal for the separable quadratic integer programming problem, there exists a feasible solution having greater objective function value and with . We further prove, under some additional assumptions, that the distance between a pair of optimal solutions to an integer quadratic programming problem with right hand side vectorsb andb, respectively, depends linearly on b–b₁. Finally the validity of all the results for nonseparable mixed-integer quadratic programs is established. The proximity results obtained in this paper are extensions of some of the results described in Cook et al. (1986) for linear integer programming.This research was partially supported by Natural Sciences and Engineering Research Council of Canada Grant 5-83998.     

二次微分系统的中心条件和通积分

本文给出在中国分类之下二次微分系统有中心时两种情况的通积分.     

自共轭椭圆型方程的样条解法

本文从二元样条空间的理论出发,构造了一类新的差分格式,并利用它得到了一类自共轭椭圆型方程的样条解,并证明了这样的解的唯一性和收敛性问题.最后,给出了一个数值例子,说明了本方法是可行的.     

Multivariate optimization and comparison between conventional extraction (CE) and ultrasonic-assisted extraction (UAE) of carotenoid extraction from cashew apple

Carotenoids are an essential component of cashew and can be used in pharmaceuticals, cosmetics, natural pigment, food additives, among other applications. The present work focuses on optimizing and comparing conventional and ultrasound-assisted extraction methods. Every optimization step took place with a 1:1 (w:w) mixture of yellow and red cashew apples lyophilized and ground in a cryogenic mill. A Simplex-centroid design was applied for both methods, and the solvents acetone, methanol, ethanol, and petroleum ether were evaluated. After choosing the extractor solvent, a central composite design was applied to optimize the sample mass (59–201 mg) and extraction time (6–34 min). The optimum conditions for the extractor solvent were 38% acetone, 30% ethanol, and 32% petroleum ether for CE and a mixture of 44% acetone and 56% methanol for UAE. The best experimental conditions for UAE were a sonication time of 19 min and a sample mass of 153 mg, while the CE was 23 min and 136 mg. Comparing red and yellow cashews, red cashews showed a higher carotenoid content in both methodologies. The UAE methodology was ca. 21% faster, presented a more straightforward composition of extracting solution, showed an average yield of superior carotenoid content in all samples compared to CE. Therefore, UAE has demonstrated a simple, efficient, fast, low-cost adjustment methodology and a reliable alternative for other applications involving these bioactive compounds in the studied or similar matrix.