Related papers: Special homogeneous linear systems on Hirzebruch s…

Many authors studied numeric algorithms for solving the linear systems of the pentadiagonal type. The well-known Fast Pentadiagonal System Solver algorithm is an example of such algorithms. The current article are described new numeric and…

This paper is concerned with the homogenization of Dirichlet problem of elliptic systems in a bounded, smooth domain of finite type. Both the coefficients of the elliptic operator and the Dirichlet boundary data are assumed to be periodic…

In this paper we aim to bring new approach into usage of Shoelace Algorithm for area calculation in convex polygons on Cartesian coordinate system, with concentration on point in polygon concept. Generalization of usage of the concept will…

We present a computational approach to general hyperelliptic Riemann surfaces in Weierstrass normal form. The surface is either given by a list of the branch points, the coefficients of the defining polynomial or a system of cuts for the…

We give explicit formulas for the Hodge filtration on mixed Hodge modules associated with certain hypersurfaces.

We give an algorithm to compute inhomogeneous differential equations for definite integrals with parameters. The algorithm is based on the integration algorithm for $D$-modules by Oaku. Main tool in the algorithm is the Gr\"obner basis…

This article describes a geometric partitioning software that can be used for quick computation of data partitions on many-core HPC machines. It is most suited for dynamic applications with load distributions that vary with time.…

In this paper, we introduce some new hybrid algorithms for finding a solution of a system of equilibrium problems. In these algorithms, by constructing specially cutting-halfspaces, we avoid using the extra-steps as in the extragradient…

We survey recent developments on rationality problems for algebraic varieties, with a particular emphasis on cycle-theoretic and combinatorial methods and their applications to hypersurfaces.

In this note we present an algorithm to generate new Schr\" odinger type equations explicitly solvable in terms of orthogonal polynomials or associated special functions.

We investigate robust optimization problems defined for maximizing convex functions. For finite uncertainty set, we develop a geometric branch-and-bound algorithmic approach to solve this problem. The geometric branch-and-bound algorithm…

We propose a space-efficient algorithm for hidden surface removal that combines one of the fastest previous algorithms for that problem with techniques based on bit manipulation. Such techniques had been successfully used in other settings,…

The purpose of this work is two-fold. First, we introduce an efficient homogenization-based approach to perform topology optimization of coated structures with orthotropic infill material. By making use of the relaxed design space, we can…

This paper is concerned with the primitive cohomology of a smooth projective hypersurface considered as a linear representation for its automorphism group. Using the Lefschetz-Riemann-Roch formula, the character of this representation is…

This survey gives a brief overview of theoretically and practically relevant algorithms to compute geodesic paths and distances on three-dimensional surfaces. The survey focuses on polyhedral three-dimensional surfaces.

This paper uses differential spaces to obtain some new results in integrable Hamiltonian systems

This paper presents some algorithms in linear algebraic groups. These algorithms solve the word problem and compute the spinor norm for orthogonal groups. This gives us an algorithmic definition of the spinor norm. We compute the double…

Division algorithms have been developed to reduce latency and to improve the efficiency of the processors. Floating point division is considered as a high latency operation. This papers looks into one such division algorithm, examines the…

A modified Gauss's algorithm for solving a system of linear equations in an integral ring is proposed, as well as an appropriate algorithm for calculating the elements of the adjoint matrix.

We present a new efficient algortithm for construction of linear latent structure (LLS) models. This algorithm reduces a problem of estimation of model parameters to a sequence of problems of linear algebra, which assures a low…