Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

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.     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.     

Optimal Planar Interception with Fixed End Conditions: Approximate Solutions

In a previous paper (Ref. 1), an exact solution of the optimal planar interception with fixed end conditions was derived in closed form. The optimal control was expressed as an explicit function of the state variables and two fixed parameters, obtained by solving a set of nonlinear algebraic equations involving elliptic integrals. In order to facilitate the optimal control implementation, the present paper derives a highly accurate simplified solution assuming that the ratio of the pursuer turning radius to the initial range is small. An asymptotic expansion further reduces the computational workload. Construction of a near-optimal open-loop control, based on the approximations, completes the present paper.     

Polarized Spacetime Foam

An approximate model of a spacetime foam is presented. It is supposed that in the spacetime foam each quantum handle is like to an electric dipole and therefore the spacetime foam is similar to a dielectric. If we neglect of linear sizes of the quantum handle then it can be described with an operator containing a Grassman number and either a scalar or a spinor field. For both fields the Lagrangian is presented. For the scalar field it is the dilaton gravity + electrodynamics and the dilaton field is a dielectric permeability. The spherically symmetric solution in this case give us the screening of a bare electric charge surrounded by a polarized spacetime foam and the energy of the electric field becomes finite one. In the case of the spinor field the spherically symmetric solution give us a ball of the polarized spacetime foam filled with the confined electric field. It is shown that the full energy of the electric field in the ball can be very big.     

Approximate Inverse Preconditioners for Some Large Dense Random Electrostatic Interaction Matrices

A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar to, or better than, those of a standard least squares approximate inverse preconditioner while its setup cost is only that of a diagonal block approximate inverse preconditioner. Numerical experiments on iterative solutions of linear systems with up to four million unknowns illustrate how the new preconditioner drastically outperforms standard approximate inverse preconditioners of otherwise similar construction, and especially so when the preconditioners are very sparse. AMS subject classification (2000) 65F10, 65R20, 65F35, 78A30     

Fermi, Majorana and the Statistical Model of Atoms

We give an account of the appearance and first developments of the statistical model of atoms proposed by Thomas and Fermi, focusing on the main results achieved by Fermi and his group in Rome. Particular attention is addressed to the unknown contribution to this subject by Majorana, anticipating some important results reached later by leading physicists.     

Prefiltration technique via aggregation for constructing low‐density high‐quality factorized sparse approximate inverse preconditionings

This paper considers a new approach to a priori sparsification of the sparsity pattern of the factorized approximate inverses (FSAI) preconditioner using the so‐called vector aggregation technique. The suggested approach consists in construction of the FSAI preconditioner to the aggregated matrix with a prescribed sparsity pattern. Then small entries of the computed ‘aggregated’ FSAI preconditioning matrix are dropped, and the resulting pointwise sparsity pattern is used to construct the low‐density block sparsity pattern of the FSAI preconditioning matrix to the original matrix. This approach allows to minimize (sometimes significantly) the construction costs of low‐density high‐quality FSAI preconditioners. Numerical results with sample matrices from structural mechanics and thin shell problems are presented. Copyright © 2002 John Wiley & Sons, Ltd.     

Riemann Zeta函数的六阶和

利用概率论与组合数学的方法,研究了与Riemann-zeta函数ξ(k)的部分和ξ_n(k)有关的一些级数,计算出了一些重要的和式．特别的,Euler的著名结果5ξ(4)= 2ξ~2(2)能够从四阶和式直接推出．因此,通过计算全部的11个六阶和式,研究它们之间的非平凡关系,就有可能得到ξ(3)的数值．     

管理人因素对风险项目期权估值的影响

本基于对风险项目及其“孪生证券”风险和收益特性的分析，认为真正的“孪生证券”实际中很难存在，进而提出利用“近似孪生证券”与无风险证券构造资产组合来复制实物期权收益特征，利用无风险套利分析确定项目实物期权价值的方法。但考虑到管理人因素造成的实物期权内部风险特征的不可复制性，本进一步提出利用“确定性等值”将内部风险价值V1具体化，从而实现对“近似孪生证券”方法进行修正。