Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Algorithms (4)
- Linear algebra (3)
- Matrices (2)
- Algebraic multigrid (1)
- Aviation (1)
-
- Business Logistics (1)
- Circular minor (1)
- Circular network (1)
- Circular pair (1)
- Circular planar (1)
- Coarsening algorithm (1)
- Commodity processors (1)
- Complexity (1)
- Computer Science (1)
- Computer architecture (1)
- Data sparsity (1)
- Decomposition (1)
- Degree of representability (1)
- Dense matrices (1)
- Economcs (1)
- Electrical network (1)
- Engineering (1)
- Exponential kernels (1)
- Factorization (1)
- Factorization framework (1)
- Fast multipole methods (1)
- Fused multiply-add (1)
- Gaussian linear model (1)
- Hessian matrices (1)
- Hierarchical matrix (1)
- Publication
- Publication Type
Articles 1 - 11 of 11
Full-Text Articles in Algebra
Modernization Of Scienttific Mathematics Formula In Technology, Iwasan D. Kejawa Ed.D, Prof. Iwasan D. Kejawa Ed.D
Modernization Of Scienttific Mathematics Formula In Technology, Iwasan D. Kejawa Ed.D, Prof. Iwasan D. Kejawa Ed.D
Department of Mathematics: Faculty Publications
Abstract
Is it true that we solve problem using techniques in form of formula? Mathematical formulas can be derived through thinking of a problem or situation. Research has shown that we can create formulas by applying theoretical, technical, and applied knowledge. The knowledge derives from brainstorming and actual experience can be represented by formulas. It is intended that this research article is geared by an audience of average knowledge level of solving mathematics and scientific intricacies. This work details an introductory level of simple, at times complex problems in a mathematical epidermis and computability and solvability in a Computer Science. …
Negative Representability Degree Structures Of Linear Orders With Endomorphisms, Nadimulla Kasymov, Sarvar Javliyev
Negative Representability Degree Structures Of Linear Orders With Endomorphisms, Nadimulla Kasymov, Sarvar Javliyev
Bulletin of National University of Uzbekistan: Mathematics and Natural Sciences
The structure of partially ordered sets of degrees of negative representability of linear orders with endomorphisms is studied. For these structures, the existence of incomparable, maximum and minimum degrees, infinite chains and antichains is established,and also considered connections with the concepts of reducibility of enumerations, splittable degrees and positive representetions.
Lecture 09: Hierarchically Low Rank And Kronecker Methods, Rio Yokota
Lecture 09: Hierarchically Low Rank And Kronecker Methods, Rio Yokota
Mathematical Sciences Spring Lecture Series
Exploiting structures of matrices goes beyond identifying their non-zero patterns. In many cases, dense full-rank matrices have low-rank submatrices that can be exploited to construct fast approximate algorithms. In other cases, dense matrices can be decomposed into Kronecker factors that are much smaller than the original matrix. Sparsity is a consequence of the connectivity of the underlying geometry (mesh, graph, interaction list, etc.), whereas the rank-deficiency of submatrices is closely related to the distance within this underlying geometry. For high dimensional geometry encountered in data science applications, the curse of dimensionality poses a challenge for rank-structured approaches. On the other …
Lecture 14: Randomized Algorithms For Least Squares Problems, Ilse C.F. Ipsen
Lecture 14: Randomized Algorithms For Least Squares Problems, Ilse C.F. Ipsen
Mathematical Sciences Spring Lecture Series
The emergence of massive data sets, over the past twenty or so years, has lead to the development of Randomized Numerical Linear Algebra. Randomized matrix algorithms perform random sketching and sampling of rows or columns, in order to reduce the problem dimension or compute low-rank approximations. We review randomized algorithms for the solution of least squares/regression problems, based on row sketching from the left, or column sketching from the right. These algorithms tend to be efficient and accurate on matrices that have many more rows than columns. We present probabilistic bounds for the amount of sampling required to achieve a …
Lecture 13: A Low-Rank Factorization Framework For Building Scalable Algebraic Solvers And Preconditioners, X. Sherry Li
Lecture 13: A Low-Rank Factorization Framework For Building Scalable Algebraic Solvers And Preconditioners, X. Sherry Li
Mathematical Sciences Spring Lecture Series
Factorization based preconditioning algorithms, most notably incomplete LU (ILU) factorization, have been shown to be robust and applicable to wide ranges of problems. However, traditional ILU algorithms are not amenable to scalable implementation. In recent years, we have seen a lot of investigations using low-rank compression techniques to build approximate factorizations.
A key to achieving lower complexity is the use of hierarchical matrix algebra, stemming from the H-matrix research. In addition, the multilevel algorithm paradigm provides a good vehicle for a scalable implementation. The goal of this lecture is to give an overview of the various hierarchical matrix formats, such …
Lecture 03: Hierarchically Low Rank Methods And Applications, David Keyes
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 02: Tile Low-Rank Methods And Applications (W/Review), David Keyes
Lecture 02: Tile Low-Rank Methods And Applications (W/Review), 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 11: The Road To Exascale And Legacy Software For Dense Linear Algebra, Jack Dongarra
Lecture 11: The Road To Exascale And Legacy Software For Dense Linear Algebra, Jack Dongarra
Mathematical Sciences Spring Lecture Series
In this talk, we will look at the current state of high performance computing and look at the next stage of extreme computing. With extreme computing, there will be fundamental changes in the character of floating point arithmetic and data movement. In this talk, we will look at how extreme-scale computing has caused algorithm and software developers to change their way of thinking on implementing and program-specific applications.
Lecture 00: Opening Remarks: 46th Spring Lecture Series, Tulin Kaman
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.
Lecture 06: The Impact Of Computer Architectures On The Design Of Algebraic Multigrid Methods, Ulrike Yang
Lecture 06: The Impact Of Computer Architectures On The Design Of Algebraic Multigrid Methods, Ulrike Yang
Mathematical Sciences Spring Lecture Series
Algebraic multigrid (AMG) is a popular iterative solver and preconditioner for large sparse linear systems. When designed well, it is algorithmically scalable, enabling it to solve increasingly larger systems efficiently. While it consists of various highly parallel building blocks, the original method also consisted of various highly sequential components. A large amount of research has been performed over several decades to design new components that perform well on high performance computers. As a matter of fact, AMG has shown to scale well to more than a million processes. However, with single-core speeds plateauing, future increases in computing performance need to …
Obstructive Wiring Patterns To Circular Planarity In Electrical Networks, Hannah Lebo
Obstructive Wiring Patterns To Circular Planarity In Electrical Networks, Hannah Lebo
Williams Honors College, Honors Research Projects
In order for an electrical network to be printed on a flat surface without changing the network’s input or output, it is important to consider if any wires will cross and if this problem can be avoided. If a circular network can be printed so that no wires cross, the network is said to be circular planar. In this paper, we identify a number of wiring patterns that make circular planarity impossible. We find exactly 3 wiring patterns using circular pairs with sets of two nodes, and we find exactly 78 wiring patterns using circular pairs with sets of three …