SEARCH · Search NASA

Results for “Iterative solvers”

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.

SourceResearch connectionFrom yearThrough year

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

At least 343 records · Page 19

All sources NASA NTRS DOE OSTI

DOE OSTI2019

PVRD-FASP: A Unified Solver for Modeling Carrier and Defect Transport in Photovoltaic Devices

In our paper, we present a simulator for modeling transport of charge carriers and electrically active defect centers in solar cells by treating them on an equal footing, which allows us to address metastability and reliability issues. The exact nonlinear differential equations set solved by our solver is presented. The formulation of such differential equations, namely the continuity equations, drift-diffusion equation, and Poisson equation, for studying charge and defect transport is explained. The parameters needed for forming the differential equations are taken from first principle calculations. The solver is verified with test cases built on PN heterojunctions, Cu diffusion in single crystal CdTe and comparing Silvaco simulations with our numerical results.

14 SOLAR ENERGY↗

DOE OSTI2020

An adaptive discontinuous Petrov-Galerkin method for the Grad-Shafranov equation

In this work, we propose and develop an arbitrary-order adaptive discontinuous Petrov--Galerkin (DPG) method for the nonlinear Grad--Shafranov equation. An ultraweak formulation of the DPG scheme for the equation is given based on a minimal residual method. The DPG scheme has the advantage of providing more accurate gradients compared to conventional finite element methods, which is desired for numerical solutions to the Grad--Shafranov equation. The numerical scheme is augmented with an adaptive mesh refinement approach, and a criterion based on the residual norm in the minimal residual method is developed to achieve dynamic refinement. Nonlinear solvers for the resulting system are explored and a Picard iteration with Anderson acceleration is found to be efficient to solve the system. Finally, the proposed algorithm is implemented in parallel on MFEM using a domain-decomposition approach, and our implementation is general, supporting arbitrary order of accuracy and general meshes. Furthermore, numerical results are presented to demonstrate the efficiency and accuracy of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Iterated Discontinuity Factors Based on Reference Outgoing Currents for Discontinuous Finite Element Diffusion

We present a novel formulation for iteratively computing Discontinuity Factors (DF) designed to reproduce reference partial outgoing currents at the interface between macro-regions using Discontinuous Galerkin Finite Elements to solve the multigroup neutron diffusion equation. Similarly, an expression for the boundary coefficients (BCf) is proposed to match the partial outgoing current at vacuum boundaries. Upon convergence, macro-region averaged reaction and leakage rates are preserved. In addition, we consider a source-free steady-state problem depending on the DFs. The existence of a non-trivial solution is due to the non-linearity of the problem. This form greatly simplifies the implementation within Rattlesnake and efficiently converges by updating the DFs and BCfs at every linear iteration of the Preconditioned Jacobian-Free Newton-Krylov solver. The main challenge then lies in determining an appropriate scaling factor to ensure that the initial values for the DFs and BCfs are not too far from their converged value. While this factor does not change the final solution, it has the potential to significantly affect convergence, for purely numerical reasons. An expression based on the reference fission source integral is proposed and satisfying results are presented for problems and compared to Superhomogénéisation (SPH) results with both reflecting and vacuum boundary conditions.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2018

Iterated Discontinuity Factors Based on Reference Outgoing Currents for Discontinuous Finite Element Diffusion

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2016

On the Degradation of the Effectiveness of Nonlinear Diffusion Acceleration with Parallel Block Jacobi Splitting

MOOSE's radiation transport module Rattlesnake comprises a first order S N solver that can be accelerated with a flexible Nonlinear Diffusion Acceleration. At each NDA iteration, the streaming and collision operator of the S{sub N} equations are (approximately) inverted using a transport sweep. When executed on multiple processors parallel block Jacobi (PBJ) splitting is utilized lagging the processor sub-domain's incoming angular fluxes making the implemented method asynchronous, i.e. the convergence properties of NDA become dependent on the number of concurrent tasks and details of the partitioning. Within this work, we study the NDA convergence properties for the two-dimensional C5G7 benchmark problem PBJ with p = 1, 2, 4, 8, 12, 16, 24, 32, 48, 60, 72, 96 and 144 concurrent tasks. Rosa studied the convergence properties of PBJ splitting methods with and without transport synthetic acceleration (TSA) in slab geometry and two-dimensional Cartesian geometry, respectively. Rosa's iteration scheme lags both the incoming angular fluxes and the scattering source making it very similar to the method described here. Rosa found by means of Fourier analysis that convergence of unaccelerated PBJ can degrade for optically thin subdomains, i.e. for a large number of processors given a fixed domain size. Depending on the choice of parameters application of TSA can lead to an effective algorithm. In contrast to Rosa's work, this work focuses on PBJ splitting for NDA accelerated solution of the multigroup eigenvalue problem. Later, Zerr and Anistratov used their integral transport matrix method in conjunction with PBJ. This iteration scheme is different as it does not lag the scattering source. Nevertheless, Fourier analysis with Diamond Difference spatial discretization showed that the method degrades with increasing the overall size of the spatial domain while keeping the sub-domain size constant. In the case of an infinite medium, the observed spectral radius becomes unity. These references establish the iterative performance of PBJ for one-group fixed source problems discretized on rectangular cells, but for the Rattlesnake first order NDA method, an emphasis lies on multigroup eigenvalue problems. In this setting, the additional complication arises that the low order equations are not exactly inverted, but only to some iterative criterion. Further, as the low order problem is solved using Jacobian-Free Newton Krylov methods, a suitable preconditioner for the GMRES iterations is required. As the effectiveness of the preconditioners may decrease when more concurrent processes are used, we expect the low order solve to impact the overall effectiveness of the NDA method in parallel execution as well. Therefore, this work focuses on the question of how detrimental the asynchronicity of the high and low order iterative solutions is for the effectiveness of NDA solutions of realistic, unstructured grid, multigroup eigenvalue problems. The iterative convergence properties of Rattlesnake's NDA method for multigroup eigenvalue problems are studied for varying number of concurrent processes. Rattlesnake's NDA method is asynchronous because the high order transport sweep uses PBJ splitting and because the low order solve's preconditioners, algebraic multigrid and additive Schwarz, are asynchronous. We found that up to 144 processes the number of Picard iterations increases by a factor of 2-3 affecting but not destroying NDA's parallel performance for the C5G7 benchmark problem, a representative LWR (light water reactor) configuration. The solution of the NDA low order eigenvalue problem posed greater problems than expected for the solvers currently available in Rattlesnake mainly because of problems to effectively precondition the modified low-order problem. As a matter of fact, the low order problem becomes an advection-diffusion problem. Non-robustness was observed for the AMG preconditioned coarse mesh acceleration for more than 60 concurrent processes, which was fixed by increasing the number of permissible V-cycles per AMG call. For fine mesh acceleration AMG proved to be ineffective and we resorted to ASM. For both AMG and ASM, increasing number of linear iterations per nonlinear are observed when increasing the number of processes, but for ASM this problem appears to be worse. The results from this work also indicate that initial development efforts should be diverted from implementation of a high-order parallel sweeping algorithm to the effective and robust iterative solution of the low order NDA multigroup eigenvalue problem. (authors)

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2013

QCAD Simulation and Optimization of Semiconductor Double Quantum Dots

We present the Quantum Computer Aided Design (QCAD) simulator that targets modeling quantum devices, particularly silicon double quantum dots (DQDs) developed for quantum qubits. The simulator has three differentiating features: (i) its core contains nonlinear Poisson, effective mass Schrodinger, and Configuration Interaction solvers that have massively parallel capability for high simulation throughput, and can be run individually or combined self-consistently for 1D/2D/3D quantum devices; (ii) the core solvers show superior convergence even at near-zero-Kelvin temperatures, which is critical for modeling quantum computing devices; (iii) it couples with an optimization engine Dakota that enables optimization of gate voltages in DQDs for multiple desired targets. The Poisson solver includes MaxwellBoltzmann and Fermi-Dirac statistics, supports Dirichlet, Neumann, interface charge, and Robin boundary conditions, and includes the effect of dopant incomplete ionization. The solver has shown robust nonlinear convergence even in the milli-Kelvin temperature range, and has been extensively used to quickly obtain the semiclassical electrostatic potential in DQD devices. The self-consistent Schrodinger-Poisson solver has achieved robust and monotonic convergence behavior for 1D/2D/3D quantum devices at very low temperatures by using a predictor-correct iteration scheme. The QCAD simulator enables the calculation of dot-to-gate capacitances, and comparison with experiment and between solvers. It is observed that computed capacitances are in the right ballpark when compared to experiment, and quantum confinement increases capacitance when the number of electrons is fixed in a quantum dot. In addition, the coupling of QCAD with Dakota allows to rapidly identify which device layouts are more likely leading to few-electron quantum dots. Very efficient QCAD simulations on a large number of fabricated and proposed Si DQDs have made it possible to provide fast feedback for design comparison and optimization.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

DOE OSTI2023

IDAES-PSE 2.0 Release

The Institute for the Design of Advanced Energy Systems (IDAES) Integrated Platform is a versatile computational environment offering extensive process systems engineering (PSE) capabilities for optimizing the design and operation of complex, interacting technologies and systems. IDAES enables users to efficiently search vast, complex design spaces to discover the lowest cost, most environmentally sustainable solutions while supporting the full process modeling lifecycle, from conceptual design to dynamic optimization and control. The extensible, open platform empowers users to create models of novel processes and rapidly develop custom analyses, workflows, and end-user applications. IDAES-PSE 2.0.0 Release Highlights Removal of deprecated features from IDAES v1 Update to Pyomo v6.5 – this required a number of updates to support the new NL solver writer and to address some changes in Pyomo Creation of new testing suite for backward compatibility, model robustness and verification More general implementation of the Helmholtz EoS. This brings some new features like standard property diagrams, choice of mass or mole basis, and new state variable options Standardizing names in Heat Exchanger models (breaking change from v2.0.0a2): Control Volumes named hot_side and cold_side Ports names hot_side_inlet, hot_side_outlet, cold_side_inlet and cold_side_outlet Config Blocks names hot_side_config and cold_side_config Config arguments for user provided names for each side: hot_side_name and cold_side_name. Updating Keras surrogate tool to use v1.1 of OMLT New prototype API for model initialization (idaes.core.initialization) The new API uses "Model Initializer" objects instead of class methods, allowing for the definition of multiple initialization routines for a single model A number of common, model agnostic initialization routines have also been defined, including initialization from data, block-decomposition and a general hierarchical approach equivalent to the existing method for common unit models New metadata for thermophysical properties – valid_range This can be used to record the range of values over which a property value can be trusted, such as the range of experimental data used to regress parameters A number of new utility functions have been added to check for properties with values outside the valid range and to set bounds based on this metadata Updated construction of balance expressions in Control Volumes to remove unneeded terms In the past, unneeded terms were added as a constant 0 term, however they will now be dropped entirely from the expression This was necessary due to more strict unit checking in the new Pyomo solver writer which no longer ignores 0 terms Updates to metadata for thermophysical properties to better define known properties and units of measurement This results in more strict enforcement of standard naming for thermophysical and reaction properties Users can still define custom properties, but these must be done explicitly using the define_custom_properties() method instead of being implicitly created by add_property() Updated convergence tester utility tool to support definition of benchmark files (JSON format) and comparison of performance to benchmarks Set default iteration limit for IPOPT in IDAES config to 200 iterations Update scaling of example models to work with new Pyomo NL solver writer Improve testing of extensions and examples infrastructure to avoid need for downloading files Updated distillation column to centralize common functionality and remove a number of Pyomo warnings

IDAES↗

DOE OSTI2017

Addressing Over-Solving in Multiphysics Codes with Nested Solvers

Examples of multiphysics problems in the field of nuclear engineering are numerous. For light water reactors the coupling of neutronics with thermal-hydraulics is the most predominant. Often this coupling is modeled by combining existing codes in a Picard Iteration scheme, that is, by solving one physics then using that answer to solve the other and iterating until both answers stabilize. However, simply solving to a high precision on every Picard (multiphysics) iteration is much less efficient than progressively solving to higher precisions. This unneeded work is known as over-solving. Over-solving in single-physics solvers has been studied previously for the Newton method and Chebyshev iteration. Both of these methods solve an inner linear problem that determines the next update step for the outer loop. If the inner problem is solved to a high precision in every outer iteration, the result will be substantially more computational expense (over-solving) and a higher probability of reaching the 'wrong' solution. Methods for reducing over-solving in partitioned multiphysics codes have only been developed recently. This work introduces further improvements, including an investigation of over-solving methods on both the multiphysics and single-physics levels.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2014

Optimal Shielding Design For Minimum Materials Cost or Mass - Paper 128

Material costs dominate some shielding design problems. This is certainly the case for manned nuclear power space applications for which shielding is essential and the cost of launching by rocket from Earth is high. In such situations or in those where shielding volume or mass is constrained, it is important to optimize the design. Although trial and error synthesis methods may succeed, a more systematic approach is warranted. Design automation may also potentially reduce engineering costs. The objective is to automate the design of optimal radiation shielding to meet specified attenuation requirements given a menu of allowed shielding materials, their properties and their delivered costs per unit volume. The cost-optimal design is one which, at each location in the shield, chooses the menu material minimizing a particular functional of forward and adjoint angular fluxes plus material cost. Thus a Boltzmann forward and adjoint angular flux solver with additional calculations can evaluate whether a shield design is optimal or whether improvements are possible. An iterative algorithm based on approximated optimality is proposed to solve for the optimal shield design and numerical experiments with it are discussed. The future use of 3D Boltzmann solvers will allow extending results to shaped shield designs in which material is not wasted to maintain unneeded spherical symmetry. The largest cost savings of automated optimal design of shielding is expected to be for applications involving nuclear powered manned space missions where the required shielding attenuation of radiation and costs are both large. However, less exotic applications such as the shielding of radiation facilities on Earth could also benefit from optimal shielding design, and automation of the design process may reduce engineering costs. (author)

61 RADIATION PROTECTION AND DOSIMETRY↗

DOE OSTI2015

Icing modelling in NSMB with chimera overset grids

In aerospace Engineering, the accurate simulation of ice accretion is a key element to increase flight safety and avoid accidents related to icing effects. The icing code developed in the NSMB solver is based on an Eulerian formulation for droplets tracking, an iterative Messinger model using a modified water runback scheme for ice thickness calculation and mesh deformation to track the ice/air interface through time. The whole process is parallelized with MPI and applied with chimera grids.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Impact of Increased Latent Generations on Sensitivity Calculations with SCALE

Analyses of cross section sensitivity data from systems with fissile material allow analysts to associate an importance for each material, nuclide, reaction, and neutron energy by simulating real world criticality scenarios. Although criticality safety validation efforts can be guided by the cross-section sensitivity and uncertainty data generated for a particular system, these calculations can often be computationally expensive and sometimes cumbersome without proper guidance. The TSUNAMI suite within the SCALE code package has several methods for generating sensitivity data, including multigroup and continuous energy (CE) capabilities. The release of SCALE 6.3 has three different CE methods for generating cross section sensitivity data: (1) the Iterated Fission Probability (IFP) method with the KENO Monte Carlo transport solver, (2) the IFP method with the Shift Monte Carlo transport solver, and (3) the Contributon-Linked eigenvalue sensitivity/Uncertainty estimation via Tracklength importance CHaracterization (CLUTCH) method with the KENO Monte Carlo transport solver. Although the CLUTCH method has additional parameters for generating sensitivity data files relative to the IFP method, all three methods use latent generations, which are the generations between an event (i.e., fission) and the assessment of importance based on the asymptotic population of progeny neutrons. Increasing the number of latent generations in a calculation leads to increased discrimination of the sensitivity coefficients but at the cost of the increased uncertainty associated with those generated values. Analysts must balance the accuracy of the sensitivity calculations and its uncertainty with the associated computational cost involved in generating the values. This paper discusses the impact of adjusting the latent generation parameter for a range of sensitivity values and how these changes compare with the direct perturbation values obtained from a change of ±0.5% Δ k in both benchmark and safety application models. Two benchmarks from the International Handbook of Evaluated Criticality Safety Benchmark Experiments and the MPC-32 dual purpose canister for spent nuclear fuel are used for analysis.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2023

Deterministic-Monte Carlo Hybrid Methods for Eigenvalue Sensitivity Coefficient Calculations

The TSUNAMI suite within the SCALE code package includes several methods for generating sensitivity data, including multigroup (MG) and continuous-energy (CE) capabilities. For generating sensitivities with CE data, three methods are available in SCALE 6.3.0: (1) the iterated fission probability (IFP) method with the KENO Monte Carlo transport solver, (2) IFP with the Shift Monte Carlo transport solver, and (3) the Contributon-Linked eigenvalue sensitivity/Uncertainty estimation via Tracklength importance Characterization (CLUTCH) with the KENO Monte Carlo transport solver. Currently, it is difficult to generate accurate sensitivities with large reflectors when using the CLUTCH method, specifically with fissionable and hydrogenous materials. To address this issue, the work presented herein examines a methodology to calculate the adjoint flux externally with the 3D deterministic SN transport code DENOVO in SCALE; the result is then read directly into the CLUTCH-TSUNAMI sequence. This hybridization method replaces the Monte Carlo F*(r) calculation in CLUTCH while still utilizing the forward calculation. The critical benchmark HEU-MET-FAST-028-001 is used to generate sensitivities based on the inability of CLUTCH to generate accurate sensitivities. Results from the hybrid method appear to generate sensitivity values that are in excellent agreement with direct perturbations. Although further testing is needed, the method provides promising results for the development and utility of a hybrid method for use in TSUNAMI.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2025

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗

DOE OSTI2020

Scalable implementation of polynomial filtering for density functional theory calculation in PARSEC

In this work, we present an efficient implementation of polynomial filtering methods in PARSEC, a real-space pseudopotential based Kohn–Sham density functional theory solver. The implementation described here improves upon a Chebyshev-filtered subspace iteration algorithm used in the previous version of PARSEC. We present a hybrid polynomial filtering scheme that combines Chebyshev-filtered subspace iteration and a spectrum slicing method that partitions the spectrum into several spectral slices and uses bandpass-filtered subspace iteration to compute approximate eigenpairs within each interior slice simultaneously. We describe a procedure to partition a spectrum and construct polynomial filters. We also discuss a number of practical issues such as the use of appropriate data layouts for carrying out the computation on a two-dimensional process grid and how to achieve good load balance by allocating an appropriate number of process groups to each spectral slice. Numerical examples are presented to demonstrate the effectiveness of the hybrid polynomial filtering method as well as the superior parallel scalability of spectrum slicing in comparison to that of Chebyshev-filtered subspace iteration.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2011

Role of Combined NNBI and ICRH Heating in FAST H-mode plasmas

The combination of ICRH+NNBI in FAST allows the generation of fast ion populations with different velocity space anisotropy and radial profiles. These energetic ion populations can excite meso-scale fluctuations with the same characteristics of those expected in reactor conditions and, for this reason, FAST can address a number of important burning plasma physics issues. Numerical simulation and modeling of energetic particle physics are based on the use of transport codes that are iteratively coupled with a bi-dimensional full wave-quasi-linear solver for ICRH, in order to determinate the normalized supra-thermal population pressure ss{sub hot}. The value of ss{sub hot}. as well the energetic particle distribution functions can be used as initial condition for numerical simulation studies, investigating the destabilization and saturation of fast ion driven Alfvenic modes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2023

Probability of Initiation in Neutron Transport

We discuss the numerical solution of the nonlinear integro-differential equation for the probability of a divergent neutron chain in a stationary system (i.e., the probability of initiation (POI)). We follow the development described in Bell’s classic paper on the stochastic theory of neutron transport. As noted by Bell, the linearized form of this equation resembles the linear adjoint neutron transport equation. A matrix formalism for the discretized steady state (or forward) neutron equation in slab geometry is first developed and is then used to derive the discrete adjoint equation. A main advantage of this discrete development is that the resulting discrete adjoint equation does not depend upon how the multigroup cross sections for the forward problem are obtained. That is, we derive the discrete adjoint directly from the discrete forward equations rather than discretizing directly the adjoint equation. This also guarantees that the discrete adjoint operator is consistent with the inner product used to define the adjoint operator. We discuss three approaches for the numerical solution of the POI equations, and present numerical results on several test problems. The three solution methods are a simple fixed-point iteration, a second approach that is akin to a nonlinear Power iteration, and a third approach which uses a Newton-Krylov nonlinear solver. We also give sufficient conditions to guarantee the existence and uniqueness of nontrivial solutions to our discrete POI equations when the discrete system is supercritical, and that only the trivial solution exists when the discrete system is subcritical. Our approach is modeled after the analysis presented for the continuous POI equations by Mokhtar-Kharroubi and Jarmouni-Idrissi, and by Pazy and Rabinowitz.

42 ENGINEERING↗

DOE OSTI2011

Probability of Initiation in Neutron Transport

We discuss the numerical solution of the nonlinear integro-differential equation for the probability of a divergent neutron chain in a stationary system (i.e., the probability of initiation (POI)). We follow the development described in Bell’s classic paper on the stochastic theory of neutron transport. As noted by Bell, the linearized form of this equation resembles the linear adjoint neutron transport equation. A matrix formalism for the discretized steady state (or forward) neutron equation in slab geometry is first developed, and is then used to derive the discrete adjoint equation. A main advantage of this discrete development is that the resulting discrete adjoint equation does not depend upon how the multigroup cross sections for the forward problem are obtained. That is, we derive the discrete adjoint directly from the discrete forward equations rather than discretizing directly the adjoint equation. This also guarantees that the discrete adjoint operator is consistent with the inner product used to define the adjoint operator. We discuss three approaches for the numerical solution of the POI equations, and present numerical results on several test problems. The three solution methods are a simple fixed point iteration, a second approach that is akin to a nonlinear Power iteration, and a third approach which uses a Newton-Krylov nonlinear solver. We also give sufficient conditions to guarantee the existence and uniqueness of nontrivial solutions to our discrete POI equations when the discrete system is supercritical, and that only the trivial solution exists when the discrete system is subcritical. Our approach is modelled after the analysis presented for the continuous POI equations by Mokhtar-Kharroubi and Jarmouni-Idrissi [12], and by Pazy and Rabinowitz [14].

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2017

Efficient convolutional sparse coding

Computationally efficient algorithms may be applied for fast dictionary learning solving the convolutional sparse coding problem in the Fourier domain. More specifically, efficient convolutional sparse coding may be derived within an alternating direction method of multipliers (ADMM) framework that utilizes fast Fourier transforms (FFT) to solve the main linear system in the frequency domain. Such algorithms may enable a significant reduction in computational cost over conventional approaches by implementing a linear solver for the most critical and computationally expensive component of the conventional iterative algorithm. The theoretical computational cost of the algorithm may be reduced from O(M.sup.3N) to O(MN log N), where N is the dimensionality of the data and M is the number of elements in the dictionary. This significant improvement in efficiency may greatly increase the range of problems that can practically be addressed via convolutional sparse representations.

97 MATHEMATICS AND COMPUTING↗