Optimal constrained polynomials approximation of hyperbolas based on Lupaş q‐Bézier curves

This paper presents an explicit optimal polynomial for approximating the quadratic Lupaş q‐Bézier curve. We first prove that the quadratic Lupaş q‐Bézier curve represents a hyperbola or a parabola. Then we research the approximation of quadratic Lupaş q‐Bézier curves by polynomials. Since the denominator of quadratic Lupaş q‐Bézier curves is a linear function, the explicit optimal constrained approximation is obtained. Finally, some numerical examples are presented to illustrate the effectiveness of the proposed method.     

Erratum to “Separation of representations with quadratic overgroups” [Bull. Sci. Math. 135 (2) (2011) 141–165]

In the paper entitled “Separation of representations with quadratic overgroups”, we defined the notion of quadratic overgroups, and announced that the 6-dimensional nilpotent Lie algebra g6,20 admits such a quadratic overgroup. There is a mistake in the proof. The present Erratum explains that the proposed overgroup is only weakly quadratic, and g6,20 does not admit any natural quadratic overgroup.     

Multibody elastic contact analysis by quadratic programming

A quadratic programming method for contact problems is extended to a general problem involving contact ofn elastic bodies. Sharp results of quadratic programming theory provide an equivalence between the originaln-body contact problem and the simplex algorithm used to solve the quadratic programming problem. Two multibody examples are solved to illustrate the technique.     

Tensor products and discriminants of unital quadratic forms over commutative rings

A tensor product for unital quadratic forms is introduced which extends the product of separable quadratic algebras and is naturally associative and commutative. It admits a multiplicative functor vdis, the vector discriminant, with values in symmetric bilinear forms. We also compute the usual (signed) discriminant of the tensor product in terms of the discriminants of the factors. The orthogonal group scheme of a nonsingular unital quadratic formQ of even rank is isomorphic toZ ₂×SO(Q ⁰) whereQ ⁰ is the restriction of –Q to the space of trace zero elements. We use cohomology to interpret the action of separable quadratic algebras on unital quadratic forms, and to determine which forms of odd rank can be realized asQ ⁰.     

Stochastic adaptive control for continuous-time linear systems with quadratic cost

An adaptive control problem is formulated and solved for a completely observed, continuous-time, linear stochastic system with an ergodic quadratic cost criterion. The linear transformationsA of the state,B of the control, andC of the noise are assumed to be unknown. Assuming only thatA is stable and that the pair (A, C) is controllable and using a diminishing excitation control that is asymptotically negligible for an ergodic, quadratic cost criterion it is shown that a family of least-squares estimates is strongly consistent. Furthermore, an adaptive control is given using switchings that is self-optimizing for an ergodic, quadratic cost criterion.This research was partially supported b y NSF Grants ECS-9102714, ECS-9113029, and DMS-9305936.     

Exact order of Hoffman’s error bounds for elliptic quadratic inequalities derived from vector-valued Chebyshev approximation

In this paper, we introduce the exact order of Hoffman’s error bounds for approximate solutions of elliptic quadratic inequalities. Elliptic quadratic inequalities are closely related to Chebyshev approximation of vector-valued functions (including complex-valued functions). The set of Chebyshev approximations of a vector-valued function defined on a finite set is shown to be Hausdorff strongly unique of order exactly 2 ^s for some nonnegative integer s. As a consequence, the exact order of Hoffman’s error bounds for approximate solutions of elliptic quadratic inequalities is exactly 2 ^-s for some nonnegative integer s. The integer s, called the order of deficiency (which is computable), quantifies how much the Abadie constraint qualification is violated by the elliptic quadratic inequalities. Received: April 15, 1999 / Accepted: February 21, 2000?Published online July 20, 2000     

A computation of the Witt index for rational quadratic forms

Summary This paper adds the finishing touches to an algorithmic treatment of quadratic forms over the rational numbers. The Witt index of a rational quadratic form is explicitly computed. When combined with a recent adjustment in the Haase invariants, this gives a complete set of invariants for rational quadratic forms, a set which can be computed and which respects all of the standard natural operations (including the tensor product) for quadratic forms. The overall approach does not use (at least explicitly) anyp-adic methods, but it does give the Witt ring of thep-adics as well as the Witt ring of the rationals.     

A Quadratic Eigenproblem in the Analysis of a Time Delay System

In this work we solve a quadratic eigenvalue problem occurring in a method to compute the set of delays of a linear time delay system (TDS) such that the system has an imaginary eigenvalue. The computationally dominating part of the method is to find all eigenvalues z of modulus one of the quadratic eigenvalue problem where φ ₁, …, φ _{m –1} ∈ ℝ are free parameters and u a vectorization of a Hermitian rank one matrix. Because of its origin in the vectorization of a Lyapunov type matrix equation, the quadratic eigenvalue problem is, even for moderate size problems, of very large size. We show one way to treat this problem by exploiting the Lyapunov type structure of the quadratic eigenvalue problem when constructing an iterative solver. More precisely, we show that the shift-invert operation for the companion form of the quadratic eigenvalue problem can be efficiently computed by solving a Sylvester equation. The usefulness of this exploitation is demonstrated with an example. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

An analytic center quadratic cut method for the convex quadratic feasibility problem

 We consider a quadratic cut method based on analytic centers for two cases of convex quadratic feasibility problems. In the first case, the convex set is defined by a finite yet large number, N, of convex quadratic inequalities. We extend quadratic cut algorithm of Luo and Sun [3] for solving such problems by placing or translating the quadratic cuts directly through the current approximate center. We show that, in terms of total number of addition and translation of cuts, our algorithm has the same polynomial worst case complexity as theirs [3]. However, the total number of steps, where steps consist of (damped) Newton steps, function evaluations and arithmetic operations, required to update from one approximate center to another is , where ε is the radius of the largest ball contained in the feasible set. In the second case, the convex set is defined by an infinite number of certain strongly convex quadratic inequalities. We adapt the same quadratic cut method for the first case to the second one. We show that in this case the quadratic cut algorithm is a fully polynomial approximation scheme. Furthermore, we show that, at each iteration, k, the total number steps (as described above) required to update from one approximate center to another is at most , with ε as defined above. Received: April 2000 / Accepted: June 2002 Published online: September 5, 2002 Key words. convex quadratic feasibility problem – interior-point methods – analytic center – quadratic cuts – potential function     

Divergence in 3-manifold groups

The divergence of the fundamental group of compact irreducible 3-manifolds satisfying Thurston's geometrization conjecture is calculated. For every closed Haken 3-manifold group, the divergence is either linear, quadratic or exponential, where quadratic divergence occurs precisely for graph manifolds and exponential divergence occurs when a geometric piece has hyperbolic geometry. An example is given of a closed 3-manifoldN with a Riemannian metric of nonpositive curvature such that the divergence is quadratic and such that there are two geodesic rays in the universal coverN whose divergence is precisely quadratic, settling in the negative a question of Gromov's.Partially supported by NSF grant DMS-9200433.     

Von Neumann Regularity and Quadratic Conorms in JB^＊-triples and C^＊-algebras

We revise the notion of von Neumann regularity in JB^＊-triples by finding a new characterisation in terms of the range of the quadratic operator Q（a）. We introduce the quadratic conorm of an element a in a JB^＊-triple as the minimum reduced modulus of the mapping Q（a）. It is shown that the quadratic conorm of a coincides with the infimum of the squares of the points in the triple spectrum of a. It is established that a contractive bijection between JBW^＊-triples is a triple isomorphism if, and only if, it preserves quadratic conorms. The continuity of the quadratic conorm and the generalized inverse are discussed. Some applications to C^＊-algebras and von Neumann algebras are also studied.     

Quadratic functors on pointed categories

We study polynomial functors of degree 2, called quadratic, with values in the category of abelian groups Ab, and whose source category is an arbitrary category C with null object such that all objects are colimits of copies of a generating object E which is small and regular projective; this includes all categories of models V of a pointed theory T. More specifically, we are interested in such quadratic functors F from C to Ab which preserve filtered colimits and suitable coequalizers.A functorial equivalence is established between such functors F:C→Ab and certain minimal algebraic data which we call quadratic C-modules: these involve the values on E of the cross-effects of F and certain structure maps generalizing the second Hopf invariant and the Whitehead product.Applying this general result to the case where E is a cogroup these data take a particularly simple form. This application extends results of Baues and Pirashvili obtained for C being the category of groups or of modules over some ring; here quadratic C-modules are equivalent with abelian square groups or quadratic R-modules, respectively.     

On positive definite quadratic forms in correlatedt variables

Summary In this paper we extend Ruben's [4] result for quadratic forms in normal variables. He represented the distribution function of the quadratic form in normal variables as an infinite mixture of chi-square distribution functions. In the central case, we show that the distribution function of a quadratic form int-variables can be represented as a mixture of beta distribution functions. In the noncentral case, the distribution function presented is an infinite series in beta distribution functions. An application to quadratic discrimination is given.     

Norms and gauges on Clifford Algebra

From a normed quadratic space (V,q), we construct a norm on the Clifford algebra C(V,q). We describe the associated graded form of this norm and give a condition for this norm to be a gauge. Then, we apply our results to prove that for a complete discrete valued field, an anisotropic quadratic form q with dimq = 0 mod 8 and nonsplit Clifford algebra cannot be at the same time a transfer of a K-hermitian form with K∕F an inertial quadratic field extension and a transfer of a T-hermitian form with T∕F a ramified quadratic field extension.     

Towards Characterization of All 3 × 3 Extremal Quasiconvex Quadratic Forms

Given a d × d quasiconvex quadratic form, d ≥ 3, we prove that if the determinant of its acoustic tensor is an irreducible extremal polynomial that is not identically zero, then the form itself is an extremal quasiconvex quadratic form; i.e., it loses its quasiconvexity whenever a convex quadratic form is subtracted from it. In the special case d=3, we slightly weaken the condition; namely we prove that if the determinant of the acoustic tensor of the quadratic form is an extremal polynomial that is not a perfect square, then the form itself is an extremal quadratic form. In the case d=3 we also prove that if the determinant of the acoustic tensor of the form is identically zero, then the form is either extremal or polyconvex. Also, if the determinant of the acoustic tensor of the form is a perfect square, then the form is either extremal or polycovex, or is a sum of a rank‐1 form and an extremal whose acoustic tensor determinant is identically zero. Here we use the notion of extremality introduced by Milton in 1990. © 2017 Wiley Periodicals, Inc.     

Continuous piecewise linear finite elements for the Kirchhoff–Love plate equation

A family of continuous piecewise linear finite elements for thin plate problems is presented. We use standard linear interpolation of the deflection field to reconstruct a discontinuous piecewise quadratic deflection field. This allows us to use discontinuous Galerkin methods for the Kirchhoff–Love plate equation. Three example reconstructions of quadratic functions from linear interpolation triangles are presented: a reconstruction using Morley basis functions, a fully quadratic reconstruction, and a more general least squares approach to a fully quadratic reconstruction. The Morley reconstruction is shown to be equivalent to the basic plate triangle (BPT). Given a condition on the reconstruction operator, a priori error estimates are proved in energy norm and L ² norm. Numerical results indicate that the Morley reconstruction/BPT does not converge on unstructured meshes while the fully quadratic reconstruction show optimal convergence.     

A quadratically approximate framework for constrained optimization,global and local convergence

This paper presents a quadratically approximate algorithm framework （QAAF） for solving general constrained optimization problems, which solves, at each iteration, a subproblem with quadratic objective function and quadratic equality together with inequality constraints. The global convergence of the algorithm framework is presented under the Mangasarian-Fromovitz constraint qualification （MFCQ）, and the conditions for superlinear and quadratic convergence of the algorithm framework are given under the MFCQ, the constant rank constraint qualification （CRCQ） as well as the strong second-order sufficiency conditions （SSOSC）. As an incidental result, the definition of an approximate KKT point is brought forward, and the global convergence of a sequence of approximate KKT points is analysed.     

Shrinkage estimators of the location parameter for certain spherically symmetric distributions

We consider estimation of a location vector for particular subclasses of spherically symmetric distributions in the presence of a known or unknown scale parameter. Specifically, for these spherically symmetric distributions we obtain slightly more general conditions and larger classes of estimators than Brandwein and Strawderman (1991,Ann. Statist.,19, 1639–1650) under which estimators of the formX +ag(X) dominateX for quadratic loss, concave functions of quadratic loss and general quadratic loss.Research supported by NSF grant DMS-88-22622     

Convex Underestimation of Twice Continuously Differentiable Functions by Piecewise Quadratic Perturbation: Spline αBB Underestimators

This paper describes the construction of convex underestimators for twice continuously differentiable functions over box domains through piecewise quadratic perturbation functions. A refinement of the classical α BB convex underestimator, the underestimators derived through this approach may be significantly tighter than the classical αBB underestimator. The convex underestimator is the difference of the nonconvex function f and a smooth, piecewise quadratic, perturbation function, q. The convexity of the underestimator is guaranteed through an analysis of the eigenvalues of the Hessian of f over all subdomains of a partition of the original box domain. Smoothness properties of the piecewise quadratic perturbation function are derived in a manner analogous to that of spline construction.