Computing singular elements modulo squares

08/24/2020
by   Przemysław Koprowski, et al.
0

The group of singular elements was first introduced by Helmut Hasse and later it has been studied by numerous authors including such well known mathematicians as: Cassels, Furtwängler, Hecke, Knebusch, Takagi and of course Hasse himself; to name just a few. The aim of the present paper is to present algorithms that explicitly construct groups of singular and S-singular elements (modulo squares) in a global function field.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/01/2020

GMRES on singular systems revisited

In [Hayami K, Sugihara M. Numer Linear Algebra Appl. 2011; 18:449–469], ...
research
11/25/2021

Computing weakly singular and near-singular integrals in high-order boundary elements

We present algorithms for computing weakly singular and near-singular in...
research
02/02/2020

Singular Vectors From Singular Values

In the recent paper <cit.>, Denton et al. provided the eigenvector-eigen...
research
07/28/2017

The Convergence of Least-Squares Progressive Iterative Approximation with Singular Iterative Matrix

Developed in [Deng and Lin, 2014], Least-Squares Progressive Iterative A...
research
02/19/2022

Local Decomposition of Hexahedral Singular Nodes into Singular Curves

Hexahedral (hex) meshing is a long studied topic in geometry processing ...
research
10/30/2020

Diagonal groups and arcs over groups

In an earlier paper by three of the present authors and Csaba Schneider,...
research
11/17/2019

On the existence of four or more curved foldings with common creases and crease patterns

Consider a curve Γ in a domain D in the plane R^2. Thinking of D as a pi...

Please sign up or login with your details

Forgot password? Click here to reset