Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer Algebra”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 181 records · Page 10

On the Determinantal Range of Matrix Products

Let matrices A,C ∈ M{sub n} have eigenvalues α{sub 1}, . . ., α{sub n} and γ{sub 1}, . . . , γ{sub n}, respectively. The set of complex numbers D{sub C}(A) = {det(A−UCU*) : U ∈ M_n, U*U = I_n} is called the C-determinantal range of A. The paper studies various conditions under which the relation D{sub C}(R S) = D{sub C}(S R) holds for some matrices R and S.

97 MATHEMATICS AND COMPUTING↗

The Atomic Theory of Division and Intersection of Semiring Ideals

We consider two-sided ideals of semirings. More precisely, we study the theory of two-sided ideals in the signature consisting of the predicate symbol ⊆ and three function symbols that denote the intersection, right division, and left division of ideals. We prove the decidability of the set of those atomic formulas in this signature that are valid for all semirings and all valuations.

97 MATHEMATICS AND COMPUTING↗

On T-Amorphous Association Schemes

An association scheme is said to be T-amorphous if it is antisymmetric and any tournament obtained by an appropriate merging of its classes is doubly regular. The goal of this paper is to study basic properties of T-amorphous schemes.

97 MATHEMATICS AND COMPUTING↗

On the closedness and geometry of tensor network state sets

Tensor network states (TNS) are a powerful approach for the study of strongly correlated quantum matter. The curse of dimensionality is addressed by parametrizing the many-body state in terms of a network of partially contracted tensors. These tensors form a substantially reduced set of effective degrees of freedom. In practical algorithms, functionals like energy expectation values or overlaps are optimized over certain sets of TNS. Concerning algorithmic stability, it is important whether the considered sets are closed because, otherwise, the algorithms may approach a boundary point that is outside the TNS set and tensor elements diverge. Here we discuss the closedness and geometries of TNS sets, and we propose regularizations for optimization problems on non-closed TNS sets. We show that sets of matrix product states (MPS) with open boundary conditions, tree tensor network states, and the multiscale entanglement renormalization ansatz are always closed, whereas sets of translation-invariant MPS with periodic boundary conditions (PBC), heterogeneous MPS with PBC, and projected entangled pair states are generally not closed. The latter is done using explicit examples like the W state, states that we call two-domain states, and fine-grained versions thereof.

97 MATHEMATICS AND COMPUTING↗

Cyclic codes over the ring F{sub 2}+uF{sub 2}+vF{sub 2}

In this paper, we study linear and cyclic codes over the ring F{sub 2}+uF{sub 2}+vF{sub 2}. The ring F{sub 2}+uF{sub 2}+vF{sub 2} is the smallest non-Frobenius ring. We characterize the structure of cyclic codes over the ring R=F{sub 2}+uF{sub 2}+vF{sub 2} using of the work Abualrub and Saip (Des Codes Cryptogr 42:273–287, 2007). We study the rank and dual of cyclic codes of odd length over this ring. Specially, we show that the equation |C||C{sup ⊥}|=|R|{sup n} does not hold in general for a cyclic code C of length n over this ring. We also obtain some optimal binary codes as the images of cyclic codes over the ring F{sub 2}+uF{sub 2}+vF{sub 2} under a Gray map, which maps Lee weights to Hamming weights. Finally, we give a condition for cyclic codes over R that contains its dual and find quantum codes over F{sub 2} from cyclic codes over the ring F{sub 2}+uF{sub 2}+vF{sub 2}.

97 MATHEMATICS AND COMPUTING↗

Efficient solvers for hybridized three-field mixed finite element coupled poromechanics

We consider a mixed hybrid finite element formulation for coupled poromechanics. A stabilization strategy based on a macro-element approach is advanced to eliminate the spurious pressure modes appearing in undrained/incompressible conditions. The efficient solution of the stabilized mixed hybrid block system is addressed by developing a class of block triangular preconditioners based on a Schur-complement approximation strategy. Robustness, computational efficiency and scalability of the proposed approach are theoretically discussed and tested using challenging benchmark problems on massively parallel architectures.

42 ENGINEERING↗

An aggregation-based nonlinear multigrid solver for two-phase flow and transport in porous media

A nonlinear multigrid solver for two-phase flow and transport in a mixed fractional-flow velocity-pressure-saturation formulation is proposed. The solver, which is under the framework of the full approximation scheme (FAS), extends our previous work on nonlinear multigrid for heterogeneous diffusion problems. The coarse spaces in the multigrid hierarchy are constructed by first aggregating degrees of freedom, and then solving some local flow problems. The mixed formulation and the choice of coarse spaces allow us to assemble the coarse problems without visiting finer levels during the solving phase, which is crucial for the scalability of multigrid methods. Specifically, a natural generalization of the upwind flux can be evaluated directly on coarse levels using the precomputed coarse flux basis vectors. We find that the resulting solver is applicable to problems discretized on general unstructured grids. The performance of the proposed nonlinear multigrid solver in comparison with the standard single level Newton's method is demonstrated through challenging numerical examples. It is observed that the proposed solver is robust for highly nonlinear problems and clearly outperforms Newton's method in the case of high Courant-Friedrichs-Lewy (CFL) numbers.

58 GEOSCIENCES↗

Finite-size effects in periodic coupled cluster calculations

Here, we provide the first rigorous study of the finite-size error in the simplest and representative coupled cluster theory, namely the coupled cluster doubles (CCD) theory, for gapped periodic systems. Given exact Hartree-Fock orbitals and their corresponding orbital energies, we demonstrate that the correlation energy obtained from the approximate CCD method, after a finite number of fixed-point iterations over the amplitude equation, exhibits a finite-size error scaling as $\mathcal{O}(N^{-\frac{1}{3}}_k)$. Here $N_k$ is the number of discretization points in the Brillouin zone and characterizes the system size. Under additional assumptions ensuring the convergence of the fixed-point iterations, we demonstrate that the CCD correlation energy also exhibits a finite-size error scaling as $\mathcal{O}(N^{-\frac{1}{3}}_k)$. Our analysis shows that the dominant error lies in the coupled cluster amplitude calculation, and the convergence of the finite-size error in energy calculation can be boosted to $\mathcal{O}(N^{-1}_k)$ with accurate amplitudes. This also provides the first proof of the scaling of the finite-size error in the third order Møller-Plesset perturbation theory (MP3) for periodic systems.

97 MATHEMATICS AND COMPUTING↗

Tsirelson's problem and asymptotically commuting unitary matrices

In this paper, we consider quantum correlations of bipartite systems having a slight interaction, and reinterpret Tsirelson's problem (and hence Kirchberg's and Connes's conjectures) in terms of finite-dimensional asymptotically commuting positive operator valued measures. We also consider the systems of asymptotically commuting unitary matrices and formulate the Stronger Kirchberg Conjecture.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Combinatorial theory of the semiclassical evaluation of transport moments II: Algorithmic approach for moment generating functions

Electronic transport through chaotic quantum dots exhibits universal behaviour which can be understood through the semiclassical approximation. Within the approximation, calculation of transport moments reduces to codifying classical correlations between scattering trajectories. These can be represented as ribbon graphs and we develop an algorithmic combinatorial method to generate all such graphs with a given genus. This provides an expansion of the linear transport moments for systems both with and without time reversal symmetry. The computational implementation is then able to progress several orders further than previous semiclassical formulae as well as those derived from an asymptotic expansion of random matrix results. The patterns observed also suggest a general form for the higher orders.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An index for two-dimensional SPT states

We define an index for 2D G-invariant invertible states of bosonic lattice systems in the thermodynamic limit for a finite symmetry group G with a unitary action. Furthermore, we show that this index is an invariant of the symmetry protected phase.

97 MATHEMATICS AND COMPUTING↗

Novel superposed kinklike and pulselike solutions for several nonlocal nonlinear equations

In this work, we show that a number of nonlocal nonlinear equations, including the Ablowitz–Musslimani and Yang variant of the nonlocal nonlinear Schrödinger (NLS) equation, the nonlocal modified Korteweg de Vries (mKdV) equation, and the nonlocal Hirota equation, admit novel kinklike and pulselike superposed periodic solutions. Furthermore, we show that the nonlocal mKdV equation also admits the superposed (hyperbolic) kink–antikink solution. In addition, we show that while the nonlocal Ablowitz–Musslimani variant of the NLS admits complex parity-time reversal-invariant kink and pulse solutions, neither the local NLS nor the Yang variant of the nonlocal NLS admits such solutions. Finally, except for the Yang variant of the nonlocal NLS, we show that the other three nonlocal equations admit both the kink and pulse solutions in the same model.

97 MATHEMATICS AND COMPUTING↗