计算代数方程组孤立奇异解的符号数值方法

求解代数方程组是计算代数几何的最基本问题之一,孤立奇异解的计算则是其中最具挑战性的课题之一,在科学与工程计算中有着广泛的应用,如机器人、计算机视觉、机器学习、人工智能、运筹学、密码学和控制论等.本文结合作者的研究成果,综述了符号数值方法在计算代数系统孤立奇异解、特别是近似奇异解精化与验证方面的研究进展,并对未来的研究方向提出了展望.     

A simple three‐wave approximate Riemann solver for the Saint‐Venant‐Exner equations

Erosion and sediments transport processes have a great impact on industrial structures and on water quality. Despite its limitations, the Saint‐Venant‐Exner system is still (and for sure for some years) widely used in industrial codes to model the bedload sediment transport. In practice, its numerical resolution is mostly handled by a splitting technique that allows a weak coupling between hydraulic and morphodynamic distinct softwares but may suffer from important stability issues. In recent works, many authors proposed alternative methods based on a strong coupling that cure this problem but are not so trivial to implement in an industrial context. In this work, we then pursue 2 objectives. First, we propose a very simple scheme based on an approximate Riemann solver, respecting the strong coupling framework, and we demonstrate its stability and accuracy through a number of numerical test cases. However, second, we reinterpret our scheme as a splitting technique and we extend the purpose to propose what should be the minimal coupling that ensures the stability of the global numerical process in industrial codes, at least, when dealing with collocated finite volume method. The resulting splitting method is, up to our knowledge, the only one for which stability properties are fully demonstrated.     

Jordan operator algebras revisited

Jordan operator algebras are norm‐closed spaces of operators on a Hilbert space with for all . In two recent papers by the authors and Neal, a theory for these spaces was developed. It was shown there that much of the theory of associative operator algebras, in particular, surprisingly much of the associative theory from several recent papers of the first author and coauthors, generalizes to Jordan operator algebras. In the present paper we complete this task, giving several results which generalize the associative case in these papers, relating to unitizations, real positivity, hereditary subalgebras, and a couple of other topics. We also solve one of the three open problems stated at the end of our earlier joint paper on Jordan operator algebras.     

On the radius of spatial analyticity for the modified Kawahara equation on the line

First, by using linear and trilinear estimates in Bourgain type analytic and Gevrey spaces, the local well‐posedness of the Cauchy problem for the modified Kawahara equation on the line is established for analytic initial data that can be extended as holomorphic functions in a strip around the x‐axis. Next we use this local result and a Gevrey approximate conservation law to prove that global solutions exist. Furthermore, we obtain explicit lower bounds for the radius of spatial analyticity given by , where can be taken arbitrarily small and c is a positive constant.     

Numerical solution of a singular integral equation arising in a cruciform crack problem

A singular integral equation arising in a cruciform crack problem is investigated in the present paper. Based on the convex technique, the piecewise Taylor-series expansion method is extended by introducing a weight parameter. An approximate solution of the singular integral equation is constructed and its convergence and error estimate are made. The variations of the approximate solutions associating with stress intensity factors are analyzed by considering internal pressures of power and sine functions, respectively. By comparing with the known methods, the observations reveal that a good approximation can be achieved using less derivative times, less discretization points, and a suitable weight parameter. The obtained results show that the crack growth is dependent on applied mechanical loadings.     

Approximate solutions and scalarization in set-valued optimization

Abstract

Certain notions of approximate weak efficient solutions are considered for a set-valued optimization problem based on vector and set criteria approaches. For approximate solutions based on the vector approach, a characterization is provided in terms of an extended Gerstewitz’s function. For the set approach case, two notions of approximate weak efficient solutions are introduced using a lower and an upper quasi order relations for sets and further compactness and stability aspects are discussed for these approximate solutions. Existence and scalarization using a generalized Gerstewitz’s function are also established for approximate solutions, based on the lower set order relation.     

On the two classes of high‐order convergent methods of approximate inverse preconditioners for solving linear systems

Two classes of methods for approximate matrix inversion with convergence orders p =3?2^k +1 (Class 1) and p =5?2^k ?1 (Class 2), k ≥1 an integer, are given based on matrix multiplication and matrix addition. These methods perform less number of matrix multiplications compared to the known hyperpower method or p th‐order method for the same orders and can be used to construct approximate inverse preconditioners for solving linear systems. Convergence, error, and stability analyses of the proposed classes of methods are provided. Theoretical results are justified with numerical results obtained by using the proposed methods of orders p =7,13 from Class 1 and the methods with orders p =9,19 from Class 2 to obtain polynomial preconditioners for preconditioning the biconjugate gradient (BICG) method for solving well‐ and ill‐posed problems. From the literature, methods with orders p =8,16 belonging to a family developed by the effective representation of the p th‐order method for orders p =2^k , k is integer k ≥1, and other recently given high‐order convergent methods of orders p =6,7,8,12 for approximate matrix inversion are also used to construct polynomial preconditioners for preconditioning the BICG method to solve the considered problems. Numerical comparisons are given to show the applicability, stability, and computational complexity of the proposed methods by paying attention to the asymptotic convergence rates. It is shown that the BICG method converges very quickly when applied to solve the preconditioned system. Therefore, the cost of constructing these preconditioners is amortized if the preconditioner is to be reused over several systems of same coefficient matrix with different right sides.     

Approximate inertial manifolds for reaction-diffusion equations in high space dimension

The concept of approximate inertial manifolds was introduced by Foiaset al. (1987) in the case of the two-dimensional Navier-Stokes equations. These manifolds are finite dimensional smooth manifolds such that the orbits enter a very thin neighborhood of the manifold after a transient time; this concept replaces the one of inertial manifold when either an inertial manifold does not exist or its existence is not known. Our aim in this paper is to prove that approximate inertial manifolds exist for reaction-diffusion equations in high space dimension by opposition with exact inertial manifolds whose existence has only been proved in low dimension and for which nonexistence results have been obtained in space dimensionn=4.     

基于可靠度的结构优化的序列近似规划算法

基于可靠度的优化的最直观解法是把可靠度和优化的各自算法搭配一起形成嵌套两层次迭代。为改善其收敛性提高计算效率,人们提出了功能测度法、半无限规划法、单层次算法等多种改进方法。本文对传统结构优化界的经典序列近似规划法改造并扩展应用于求解基于可靠度的结构优化问题,构造该问题的序列近似规划模型和求解过程;其核心思想是在每个近似规划子问题中采用近似可靠度指标对设计变量的线性近似,在优化迭代过程中同步更新设计变量和随机空间中的近似验算点坐标,以达到可靠度分析和优化迭代同步收敛的目标。为了算法的实施,还推导出近似可靠度指标的半解析灵敏度计算公式,编制了程序,最终实现与通用软件的连接。论文用算例证实算法的有效性。     

矩阵方程AX=B的中心对称定秩解及其最佳逼近

本文研究了矩阵方程AX=B的中心对称解.利用矩阵对的广义奇异值分解和广义逆矩阵,获得了该方程有中心对称解的充要条件以及有解时,最大秩解、最小秩解的一般表达式,并讨论了中心对称最小秩解集合中与给定矩阵的最佳逼近解.