arXiv subjects

Dileepan Joseph

Publications and source records attributed to Dileepan Joseph.

3 recordsLinked to original sources

arXiv2026

Ricci-Notation Tensor Framework for Numerical Algebraic Geometry via Any-Degree Unitary-Triangular Factorization

The unitary-triangular (QR) factorization of linear algebra may be used to robustly and efficiently solve a linear system. Toward a comparable numerical method to solve a polynomial system of higher degree, this paper proposes an any-degree unitary-triangular (Qr) factorization, which for a degree-one system reduces to the QR factorization. The work develops a tensor framework, i.e., codesigned algebra and software, where polynomial system coefficients are represented by a vector-shaped sparse tensor, a multidimensional array whose number of Ricci-notation indices, called the tensor degree, equals the highest monomial degree of the system. With the proposed Qr factorization, the coefficient tensor decomposes into a product of unitary and triangular factors that, in general, also have Ricci-notation indices and sparse entries. The unitary factor defines a unitary transform, a generalization of the related linear algebra concept to tensor algebra, that can triangularize a polynomial system while preserving its solution set, whether zero- or positive-dimensional. The work extends the author's Ricci-notation tensor framework, providing new algebra and new software to model, construct, and factorize polynomial systems in this manner. After applying the approach to numerically triangularize two zero-dimensional systems, chosen for educational value, results are compared to the Gr\"obner-basis (GB) method for triangularizing polynomial systems symbolically. One problem is of degree three, with three equations and unknowns, and the other of degree two, with four equations and unknowns. Although it resembles GB triangularization, the proposed Qr factorization has a completely different pedigree associated with numerical methods.

math.NA↗

arXiv2023

Ricci-Notation Tensor Framework for Model-based Approaches to Imaging

Model-based approaches to imaging, like specialized image enhancements in astronomy, facilitate explanations of relationships between observed inputs and computed outputs. These models may be expressed with extended matrix-vector (EMV) algebra, especially when they involve only scalars, vectors, and matrices, and with n-mode or index notations, when they involve multidimensional arrays, also called numeric tensors or, simply, tensors. While this paper features an example, inspired by exoplanet imaging, that employs tensors to reveal (inverse) 2D fast Fourier transforms in an image enhancement model, the work is actually about the tensor algebra and software, or tensor frameworks, available for model-based imaging. The paper proposes a Ricci-notation tensor (RT) framework, comprising a dual-variant index notation, with Einstein summation convention, and codesigned object-oriented software, called the RTToolbox for MATLAB. Extensions to Ricci notation offer novel representations for entrywise, pagewise, and broadcasting operations popular in EMV frameworks for imaging. Complementing the EMV algebra computable with MATLAB, the RTToolbox demonstrates programmatic and computational efficiency via careful design of numeric tensor and dual-variant index classes. Compared to its closest competitor, also a numeric tensor framework that uses index notation, the RT framework enables superior ways to model imaging problems and, thereby, to develop solutions.

cs.MS↗

arXiv2018

High Performance Rearrangement and Multiplication Routines for Sparse Tensor Arithmetic

Researchers are increasingly incorporating numeric high-order data, i.e., numeric tensors, within their practice. Just like the matrix/vector (MV) paradigm, the development of multi-purpose, but high-performance, sparse data structures and algorithms for arithmetic calculations, e.g., those found in Einstein-like notation, is crucial for the continued adoption of tensors. We use the example of high-order differential operators to illustrate this need. As sparse tensor arithmetic is an emerging research topic, with challenges distinct from the MV paradigm, many aspects require further articulation. We focus on three core facets. First, aligning with prominent voices in the field, we emphasise the importance of data structures able to accommodate the operational complexity of tensor arithmetic. However, we describe a linearised coordinate (LCO) data structure that provides faster and more memory-efficient sorting performance. Second, flexible data structures, like the LCO, rely heavily on sorts and permutations. We introduce an innovative permutation algorithm, based on radix sort, that is tailored to rearrange already-sorted sparse data, producing significant performance gains. Third, we introduce a novel poly-algorithm for sparse tensor products, where hyper-sparsity is a possibility. Different manifestations of hyper-sparsity demand their own approach, which our poly-algorithm is the first to provide. These developments are incorporated within our LibNT and NTToolbox software libraries. Benchmarks, frequently drawn from the high-order differential operators example, demonstrate the practical impact of our routines, with speed-ups of 40% or higher compared to alternative high-performance implementations. Comparisons against the MATLAB Tensor Toolbox show over 10 times speed improvements. Thus, these advancements produce significant practical improvements for sparse tensor arithmetic.

cs.MS↗