ON AUGMENTED LAGRANGIAN METHODS FOR SADDLE-POINT LINEAR SYSTEMS WITH SINGULAR OR SEMIDEFINITE （1, 1） BLOCKS

An effective algorithm for solving large saddle-point linear systems, presented by Krukier et al., is applied to the constrained optimization problems. This method is a modification of skew-Hermitian triangular splitting iteration methods. We consider the saddle-point linear systems with singular or semidefinite （1, 1） blocks. Moreover, this method is applied to precondition the GMRES. Numerical results have confirmed the effectiveness of the method and showed that the new method can produce high-quality preconditioners for the Krylov subspace methods for solving large sparse saddle-point linear systems.     

General techniques for constructing variational integrators

The numerical analysis of variational integrators relies on variational error analysis, which relates the order of accuracy of a variational integrator with the order of approximation of the exact discrete Lagrangian by a computable discrete Lagrangian. The exact discrete Lagrangian can either be characterized variationally, or in terms of Jacobi’s solution of the Hamilton-Jacobi equation. These two characterizations lead to the Galerkin and shooting constructions for discrete Lagrangians, which depend on a choice of a numerical quadrature formula, together with either a finite-dimensional function space or a one-step method. We prove that the properties of the quadrature formula, finite-dimensional function space, and underlying one-step method determine the order of accuracy and momentum-conservation properties of the associated variational integrators. We also illustrate these systematic methods for constructing variational integrators with numerical examples.     

Discretization of Compact Riemannian Manifolds Applied to the Spectrum of Laplacian

For κ ⩾ 0 and r₀ > 0 let ℳ(n, κ, r₀) be the set of all connected, compact n-dimensional Riemannian manifolds (Mⁿ, g) with Ricci (M, g) ⩾ −(n−1) κ g and Inj (M) ⩾ r₀. We study the relation between the kth eigenvalue λ_k(M) of the Laplacian associated to (Mⁿ,g), Δ = −div(grad), and the kth eigenvalue λ_k(X) of a combinatorial Laplacian associated to a discretization X of M. We show that there exist constants c, C > 0 (depending only on n, κ and r₀) such that for all M ∈ ℳ(n, κ, r₀) and X a discretization of for all k < |X|. Then, we obtain the same kind of result for two compact manifolds M and N ∈ ℳ(n, κ, r₀) such that the Gromov–Hausdorff distance between M and N is smaller than some η > 0. We show that there exist constants c, C > 0 depending on η, n, κ and r₀ such that for all . Mathematics Subject Classification (2000): 58J50, 53C20 Supported by Swiss National Science Foundation, grant No. 20-101 469     

Heart rate variability analysis by chaotic global techniques in children with attention deficit hyperactivity disorder

Attention deficit hyperactivity disorder (ADHD) is characterized by decreased attention span, impulsiveness, and hyperactivity. Autonomic nervous system imbalance was previously described in this population. We aim to compare the autonomic function of children with ADHD and controls by analyzing heart rate variability (HRV). Children with ADHD (22 boys, mean age 9.964 years) and 28 controls (15 boys, mean age 9.857 years) rested in supine position with spontaneous breathing for 20 min. Heart rate was recorded beat by beat. HRV analysis was performed by use of chaotic global techniques. ADHD promoted an increase in the chaotic forward parameter. The algorithm which applied all three chaotic global parameters was only the second optimum statistically measured by Kruskal–Wallis (P < 0.0001) and low standard deviations. It was also highly influential by principal component analysis with almost all variation covered by the first two components. The third algorithm which lacked the (high spectral Detrended Fluctuation Analysis) parameter performed best statistically. However, we chose the algorithm which applied all three chaotic globals due to previous studies mentioned in the text—forward and inverse problems. Comparison of the autonomic function by analyzing HRV with chaotic global techniques suggests an increase in chaotic activity in children with ADHD in relation to the control group. © 2015 Wiley Periodicals, Inc. Complexity 21: 412–419, 2016     

The Patterson–Sullivan Embedding and Minimal Volume Entropy for Outer Space

Motivated by Bonahon’s result for hyperbolic surfaces, we construct an analogue of the Patterson–Sullivan–Bowen–Margulis map from the Culler–Vogtmann outer space CV (F _k ) into the space of projectivized geodesic currents on a free group. We prove that this map is a continuous embedding and thus obtain a new compactification of the outer space. We also prove that for every k ≥ 2 the minimum of the volume entropy of the universal covers of finite connected volume-one metric graphs with fundamental group of rank k and without degree-one vertices is equal to (3k − 3) log 2 and that this minimum is realized by trivalent graphs with all edges of equal lengths, and only by such graphs. Received: December 2005, Accepted: March 2006     

The raised-cosine wavelets in computerized tomography

In Computerized Tomography (CT), an image must be recovered from its sampled projections in the form of values of the Radon transform. In this work a method of recovering the image is based on the properties of the raised-cosine wavelet. This wavelet has a closed form which allows for certain precomputations and avoids convolution. The rate of convergence of the resulting algorithm to the image density function is found under suitable hypotheses. This algorithm is then tested on the standard Shepp–Logan     

Interfacial long traveling waves in a two‐layer fluid with variable depth

Long wave propagation in a two‐layer fluid with variable depth is studied for specific bottom configurations, which allow waves to propagate over large distances. Such configurations are found within the linear shallow‐water theory and determined by a family of solutions of the second‐order ordinary differential equation (ODE) with three arbitrary constants. These solutions can be used to approximate the true bottom bathymetry. All such solutions represent smooth bottom profiles between two different singular points. The first singular point corresponds to the point where the two‐layer flow transforms into a uniform one. In the vicinity of this point nonlinear shallow‐water theory is used and the wave breaking criterion, which corresponds to the gradient catastrophe is found. The second bifurcation point corresponds to an infinite increase in water depth, which contradicts the shallow‐water assumption. This point is eliminated by matching the “nonreflecting” bottom profile with a flat bottom. The wave transformation at the matching point is described by the second‐order Fredholm equation and its approximated solution is then obtained. The results extend the theory of internal waves in inhomogeneous stratified fluids actively developed by Prof. Roger Grimshaw, to the new solutions types.     

On the dependence of the reflection operator on boundary conditions for biharmonic functions

The biharmonic equation arises in areas of continuum mechanics including linear elasticity theory and the Stokes flows, as well as in a radar imaging problem. We discuss the reflection formulas for the biharmonic functions u(x,y)∈R² subject to different boundary conditions on a real-analytic curve in the plane. The obtained formulas, generalizing the celebrated Schwarz symmetry principle for harmonic functions, have different structures. In particular, in the special case of the boundary, Γ₀:={y=0}, reflections are point-to-point when the given on Γ₀ conditions are u=n_∂u=0, u=Δu=0 or n_∂u=n_∂Δu=0, and point to a continuous set when u=n_∂Δu=0 or n_∂u=Δu=0 on Γ₀.