Algebraic Geometry Commons^™

The Design And Implementation Of A High-Performance Polynomial System Solver, Alexander Brandt

Electronic Thesis and Dissertation Repository

This thesis examines the algorithmic and practical challenges of solving systems of polynomial equations. We discuss the design and implementation of triangular decomposition to solve polynomials systems exactly by means of symbolic computation.

Incremental triangular decomposition solves one equation from the input list of polynomials at a time. Each step may produce several different components (points, curves, surfaces, etc.) of the solution set. Independent components imply that the solving process may proceed on each component concurrently. This so-called component-level parallelism is a theoretical and practical challenge characterized by irregular parallelism. Parallelism is not an algorithmic property but rather a geometrical …

Academic Hats And Ice Cream: Two Optimization Problems, Valery F. Ochkov, Yulia V. Chudova

Journal of Humanistic Mathematics

This article describes the use of computer software to optimize the design of an academic hat and an ice cream cone!

Cache-Friendly, Modular And Parallel Schemes For Computing Subresultant Chains, Mohammadali Asadi

Electronic Thesis and Dissertation Repository

The RegularChains library in Maple offers a collection of commands for solving polynomial systems symbolically with taking advantage of the theory of regular chains. The primary goal of this thesis is algorithmic contributions, in particular, to high-performance computational schemes for subresultant chains and underlying routines to extend that of RegularChains in a C/C++ open-source library.

Subresultants are one of the most fundamental tools in computer algebra. They are at the core of numerous algorithms including, but not limited to, polynomial GCD computations, polynomial system solving, and symbolic integration. When the subresultant chain of two polynomials is involved in a client …

Searching For New Relations Among The Eilenberg-Zilber Maps, Owen T. Abma

Undergraduate Student Research Internships Conference

The goal of this project was to write a computer program that would aid in the search for relations among the Eilenberg-Zilber maps, which relate to simplicial objects in algebraic topology. This presentation outlines the process of writing this program, the challenges faced along the way, and the final results of the project.

Lecture 03: Hierarchically Low Rank Methods And Applications, David Keyes

Mathematical Sciences Spring Lecture Series

As simulation and analytics enter the exascale era, numerical algorithms, particularly implicit solvers that couple vast numbers of degrees of freedom, must span a widening gap between ambitious applications and austere architectures to support them. We present fifteen universals for researchers in scalable solvers: imperatives from computer architecture that scalable solvers must respect, strategies towards achieving them that are currently well established, and additional strategies currently being developed for an effective and efficient exascale software ecosystem. We consider recent generalizations of what it means to “solve” a computational problem, which suggest that we have often been “oversolving” them at the …

Lecture 00: Opening Remarks: 46th Spring Lecture Series, Tulin Kaman

Mathematical Sciences Spring Lecture Series

Opening remarks for the 46th Annual Mathematical Sciences Spring Lecture Series at the University of Arkansas, Fayetteville.

Squared Distance Matrix Of A Weighted Tree, Ravindra B. Bapat

Journal Articles

Let T be a tree with vertex set f1;: :: ; ng such that each edge is assigned a nonzero weight. The squared distance matrix of T; denoted by is the n n matrix with (i; j)-element d(i; j)2; where d(i; j) is the sum of the weights of the edges on the (ij)-path. We obtain a formula for the determinant of A formula for 1 is also obtained, under certain conditions. The results generalize known formulas for the unweighted case.

Calculating The Cohomology Of A Lie Algebra Using Maple And The Serre Hochschild Spectral Sequence, Jacob Kullberg

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Lie algebra cohomology is an important tool in many branches of mathematics. It is used in the Topology of homogeneous spaces, Deformation theory, and Extension theory. There exists extensive theory for calculating the cohomology of semi simple Lie algebras, but more tools are needed for calculating the cohomology of general Lie algebras. To calculate the cohomology of general Lie algebras, I used the symbolic software program called Maple. I wrote software to calculate the cohomology in several different ways. I wrote several programs to calculate the cohomology directly. This proved to be computationally expensive as the number of differential forms …