Search NASA⌕ Search

SEARCH · Search NASA

Results for “discrete optimization”

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 1,765 records · Page 98

Advanced Fluid Reduced Order Models for Compressible Flow.

This report summarizes fiscal year (FY) 2017 progress towards developing and implementing within the SPARC in-house finite volume flow solver advanced fluid reduced order models (ROMs) for compressible captive-carriage flow problems of interest to Sandia National Laboratories for the design and qualification of nuclear weapons components. The proposed projection-based model order reduction (MOR) approach, known as the Proper Orthogonal Decomposition (POD)/Least- Squares Petrov-Galerkin (LSPG) method, can substantially reduce the CPU-time requirement for these simulations, thereby enabling advanced analyses such as uncertainty quantification and de- sign optimization. Following a description of the project objectives and FY17 targets, we overview briefly the POD/LSPG approach to model reduction implemented within SPARC . We then study the viability of these ROMs for long-time predictive simulations in the context of a two-dimensional viscous laminar cavity problem, and describe some FY17 enhancements to the proposed model reduction methodology that led to ROMs with improved predictive capabilities. Also described in this report are some FY17 efforts pursued in parallel to the primary objective of determining whether the ROMs in SPARC are viable for the targeted application. These include the implemen- tation and verification of some higher-order finite volume discretization methods within SPARC (towards using the code to study the viability of ROMs on three-dimensional cavity problems) and a novel structure-preserving constrained POD/LSPG formulation that can improve the accuracy of projection-based reduced order models. We conclude the report by summarizing the key takeaways from our FY17 findings, and providing some perspectives for future work.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Revisiting matrix-based inversion of scanning mobility particle sizer (SMPS) and humidified tandem differential mobility analyzer (HTDMA) data

Abstract. Tikhonov regularization is a tool for reducing noise amplification during data inversion. This work introduces RegularizationTools.jl, a general-purpose software package for applying Tikhonov regularization to data. The package implements well-established numerical algorithms and is suitable for systems of up to ∼ 1000 equations. Included is an abstraction to systematically categorize specific inversion configurations and their associated hyperparameters. A generic interface translates arbitrary linear forward models defined by a computer function into the corresponding design matrix. This obviates the need to explicitly write out and discretize the Fredholm integral equation, thus facilitating fast prototyping of new regularization schemes associated with measurement techniques. Example applications include the inversion involving data from scanning mobility particle sizers (SMPSs) and humidified tandem differential mobility analyzers (HTDMAs). Inversion of SMPS size distributions reported in this work builds upon the freely available software DifferentialMobilityAnalyzers.jl. The speed of inversion is improved by a factor of ∼ 200, now requiring between 2 and 5 ms per SMPS scan when using 120 size bins. Previously reported occasional failure to converge to a valid solution is reduced by switching from the L-curve method to generalized cross-validation as the metric to search for the optimal regularization parameter. Higher-order inversions resulting in smooth, denoised reconstructions of size distributions are now included in DifferentialMobilityAnalyzers.jl. This work also demonstrates that an SMPS-style matrix-based inversion can be applied to find the growth factor frequency distribution from raw HTDMA data while also accounting for multiply charged particles. The outcome of the aerosol-related inversion methods is showcased by inverting multi-week SMPS and HTDMA datasets from ground-based observations, including SMPS data obtained at Bodega Marine Laboratory during the CalWater 2/ACAPEX campaign and co-located SMPS and HTDMA data collected at the US Department of Energy observatory located at the Southern Great Plains site in Oklahoma, USA. Results show that the proposed approaches are suitable for unsupervised, nonparametric inversion of large-scale datasets as well as inversion in real time during data acquisition on low-cost reduced-instruction-set architectures used in single-board computers. The included software implementation of Tikhonov regularization is freely available, general, and domain-independent and thus can be applied to many other inverse problems arising in atmospheric measurement techniques and beyond.

54 ENVIRONMENTAL SCIENCES↗

A subzone reconstruction algorithm for efficient staggered compatible remapping

Staggered-grid Lagrangian hydrodynamics algorithms frequently make use of subzonal discretization of state variables for the purposes of improved numerical accuracy, generality to unstructured meshes, and exact conservation of mass, momentum, and energy. For Arbitrary Lagrangian–Eulerian (ALE) methods using a geometric overlay, it is difficult to remap subzonal variables in an accurate and efficient manner due to the number of subzone–subzone intersections that must be computed. This becomes prohibitive in the case of 3D, unstructured, polyhedral meshes. A new procedure is outlined in this paper to avoid direct subzonal remapping. The new algorithm reconstructs the spatial profile of a subzonal variable using remapped zonal and nodal representations of the data. The reconstruction procedure is cast as an under-constrained optimization problem. Enforcing conservation at each zone and node on the remapped mesh provides the set of equality constraints; the objective function corresponds to a quadratic variation per subzone between the values to be reconstructed and a set of target reference values. Numerical results for various pure-remapping and hydrodynamics tests are provided. Ideas for extending the algorithm to staggered-grid radiation-hydrodynamics are discussed as well as ideas for generalizing the algorithm to include inequality constraints.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Geometric remapping of particle distributions in the Discrete Element Model for Sea Ice (DEMSI v0.0)

Abstract. A new sea ice dynamical core, the Discrete Element Model for Sea Ice (DEMSI), is under development for use in coupled Earth system models. DEMSI is based on the discrete element method, which models collections of ice floes as interacting Lagrangian particles. In basin-scale sea ice simulations the Lagrangian motion results in significant convergence and ridging, which requires periodic remapping of sea ice variables from a deformed particle configuration back to an undeformed initial distribution. At the resolution required for Earth system models we cannot resolve individual sea ice floes, so we adopt the sub-grid-scale thickness distribution used in continuum sea ice models. This choice leads to a series of hierarchical tracers depending on ice fractional area or concentration that must be remapped consistently. The circular discrete elements employed in DEMSI help improve the computational efficiency at the cost of increased complexity in the effective element area definitions for sea ice cover that are required for the accurate enforcement of conservation. An additional challenge is the accurate remapping of element values along the ice edge, the location of which varies due to the Lagrangian motion of the particles. In this paper we describe a particle-to-particle remapping approach based on well-established geometric remapping ideas that enforces conservation, bounds preservation, and compatibility between associated tracer quantities, while also robustly managing remapping at the ice edge. One element of the remapping algorithm is a novel optimization-based flux correction that enforces concentration bounds in the case of nonuniform motion. We demonstrate the accuracy and utility of the algorithm in a series of numerical test cases.

58 GEOSCIENCES↗

Optimization of operational strategies for rich gas enhanced oil recovery based on a pilot test in the Bakken tight oil reservoir

Horizontal well drilling and multistage hydraulic fracturing have been demonstrated as effective approaches for stimulating oil production in the Bakken tight oil reservoir. However, after multiple years of production, primary oil recovery in the Bakken is generally less than 10% of the estimated original oil in place. Gas huff ‘n’ puff (HnP) has been tested in the Bakken Formation as an enhanced oil recovery (EOR) method; however, most field pilot test results showed no significant incremental oil production. One of the factors affecting HnP EOR performance is premature gas breakthrough, which is one of the most critical issues observed in the field because of the presence of interwell fractures. Consequently, injected gas rapidly reaches adjacent production wells without contacting reservoir rock and increasing oil recovery. Proper conformance control is therefore needed to avoid early gas breakthrough and improve EOR performance. In this study, a rich gas EOR pilot in the Bakken was carefully analyzed to collect the essential reservoir and operational data. A simulation model with 16 wells was then developed to reproduce the production history and predict the EOR performance with and without conformance control. EOR operational strategies, including single- and multiple-well HnP, with different gas injection constraints were investigated. The simulation results of single-well HnP without conformance control showed that a rich gas injection rate of at least 10 MMscfd was needed to yield meaningful incremental oil production. The strategy of conformance control via water injection could significantly improve oil production in the HnP well, but injecting an excessive amount of water also leads to water breakthrough and loss of oil production in the offset wells. By analyzing the production performance of the wells individually, the arrangement of wells was optimized for multiple-well HnP EOR. The multiwell results showed that rich gas EOR could improve oil production up to 7.4% by employing conformance control strategies. Furthermore, replacing rich gas with propane as the injection gas could result in 14% of incremental oil production.

02 PETROLEUM↗

Crystal structure of ractopamine hydrochloride, C 18 H 24 NO 3 Cl

The crystal structure of ractopamine hydrochloride has been solved and refined using synchrotron X-ray powder diffraction data, and optimized using density functional theory techniques. Ractopamine hydrochloride crystallizes in space groupPbca(#61) witha= 38.5871(49),b= 10.7691(3),c= 8.4003(2) Å,V= 3490.75(41) Å 3 , andZ= 8. The ractopamine cation contains two chiral centers, and the sample consists of a mixture of the S,S/R,R/S,R and R,S forms. Models for the two diastereomers S,S and S,R were refined, and yielded equivalent residuals, but the S,R form is significantly lower in energy. The crystal structure consists of layers of molecules parallel to thebc-plane. In each structure one of the H atoms on the protonated N atom acts as a donor in a strong discrete N–H⋯Cl hydrogen bond. Hydroxyl groups act as donors in O–H⋯Cl and O–H⋯O hydrogen bonds. Both the classical and C–H⋯Cl and C–H⋯O hydrogen bonds differ between the forms, helping to explain the large microstrain observed for the sample. The powder pattern has been submitted to ICDD® for inclusion in the Powder Diffraction File™ (PDF®).

Materials Science↗

Selecting Minimal Motion Primitive Libraries with Genetic Algorithms

Motion primitives allow for application of discrete search algorithms to rapidly produce trajectories in complex continuous space. The maneuver automaton (MA) provides an elegant formulation for creating a primitive library based on trims and maneuvers. However, performance is fundamentally limited by the contents of the primitive library. If the library is too sparse, performance can be poor in terms of path cost, whereas a library that is too large can increase run time. This work outlines new methods for using genetic algorithms to prune a primitive library. The proposed methods balance the path cost and planning time while maintaining the reachability of the MA. The genetic algorithm in this paper evaluates and mutates populations of motion primitive libraries to optimize both objectives. Here, we illustrate the performance of these methods with a simulated study using a nonlinear medium-fidelity F-16 model. We optimize a library with the presented algorithm for obstacle-free navigation and a nap-of-the-Earth navigation task. In the obstacle-free navigation task, we show a tradeoff of a 10.16% higher planning cost for a 96.63% improvement in run time. In the nap-of-the-Earth task, we show a tradeoff of a 9.712% higher planning cost for a 92.06% improvement in run time.

42 ENGINEERING↗

A Lightning Channel Retrieval Algorithm for the North Alabama Lightning Mapping Array (LMA)

A new multi-station VHF time-of-arrival (TOA) antenna network is, at the time of this writing, coming on-line in Northern Alabama. The network, called the Lightning Mapping Array (LMA), employs GPS timing and detects VHF radiation from discrete segments (effectively point emitters) that comprise the channel of lightning strokes within cloud and ground flashes. The network will support on-going ground validation activities of the low Earth orbiting Lightning Imaging Sensor (LIS) satellite developed at NASA Marshall Space Flight Center (MSFC) in Huntsville, Alabama. It will also provide for many interesting and detailed studies of the distribution and evolution of thunderstorms and lightning in the Tennessee Valley, and will offer many interesting comparisons with other meteorological/geophysical wets associated with lightning and thunderstorms. In order to take full advantage of these benefits, it is essential that the LMA channel mapping accuracy (in both space and time) be fully characterized and optimized. In this study, a new revised channel mapping retrieval algorithm is introduced. The algorithm is an extension of earlier work provided in Koshak and Solakiewicz (1996) in the analysis of the NASA Kennedy Space Center (KSC) Lightning Detection and Ranging (LDAR) system. As in the 1996 study, direct algebraic solutions are obtained by inverting a simple linear system of equations, thereby making computer searches through a multi-dimensional parameter domain of a Chi-Squared function unnecessary. However, the new algorithm is developed completely in spherical Earth-centered coordinates (longitude, latitude, altitude), rather than in the (x, y, z) cartesian coordinates employed in the 1996 study. Hence, no mathematical transformations from (x, y, z) into spherical coordinates are required (such transformations involve more numerical error propagation, more computer program coding, and slightly more CPU computing time). The new algorithm also has a more realistic definition of source altitude that accounts for Earth oblateness (this can become important for sources that are hundreds of kilometers away from the network). In addition, the new algorithm is being applied to analyze computer simulated LMA datasets in order to obtain detailed location/time retrieval error maps for sources in and around the LMA network. These maps will provide a more comprehensive analysis of retrieval errors for LMA than the 1996 study did of LDAR retrieval errors. Finally, we note that the new algorithm can be applied to LDAR, and essentially any other multi-station TWA network that depends on direct line-of-site antenna excitation.

Koshak, William↗

Implicit and Implicit–Explicit Strong Stability Preserving Runge–Kutta Methods with High Linear Order

Strong stability preserving (SSP) time discretizations preserve the monotonicity properties satisfied by the spatial discretization when coupled with the first order forward Euler, under a certain time-step restriction. The search for high order strong stability preserving time-stepping methods with high order and large allowable time-step has been an active area of research. It is known that implicit SSP Runge–Kutta methods exist only up to sixth order; however, if we restrict ourselves to solving only linear autonomous problems, the order conditions simplify and we can find implicit SSP Runge–Kutta methods of any linear order. In the current work we find implicit SSP Runge–Kutta methods with high linear order p lin ≤ 9 and nonlinear orders p = 2,3,4, that are optimal in terms of allowable SSP time-step. Next, we formulate a novel optimization problem for implicit–explicit (IMEX) SSP Runge–Kutta methods and find optimized IMEX SSP Runge–Kutta pairs that have high linear order p lin ≤ 7 and nonlinear orders up to p = 4. Here, we also find implicit methods with large linear stability regions that pair with known explicit SSP Runge–Kutta methods. These methods are then tested on sample problems to demonstrate the sharpness of the SSP coefficient and the typical behavior of these methods on test problems.

97 MATHEMATICS AND COMPUTING↗

SUPG stabilization for the nonconforming virtual element method for advection–diffusion–reaction equations

We present here the design, convergence analysis and numerical investigations of the nonconforming virtual element method with Streamline Upwind/Petrov–Galerkin (VEM-SUPG) stabilization for the numerical resolution of convection–diffusion–reaction problems in the convective-dominated regime. According to the virtual discretization approach, the bilinear form is split as the sum of a consistency and a stability term. The consistency term is given by substituting the functions of the virtual space and their gradients with their polynomial projection in each term of the bilinear form (including the SUPG stabilization term). Polynomial projections can be computed exactly from the degrees of freedom. The stability term is also built from the degrees of freedom by ensuring the correct scalability properties with respect to the mesh size and the equation coefficients. The nonconforming formulation relaxes the continuity conditions at cell interfaces and a weaker regularity condition is considered involving polynomial moments of the solution jumps at cell interface. Optimal convergence properties of the method are proved in a suitable norm, which includes contribution from the advective stabilization terms. Experimental results confirm the theoretical convergence rates.

97 MATHEMATICS AND COMPUTING↗

Experimental study on discretely modulated continuous-variable quantum key distribution

We present a discretely modulated continuous-variable quantum key distribution system in free space by using strong coherent states. The amplitude noise in the laser source is suppressed to the shot-noise limit by using a mode cleaner combined with a frequency shift technique. Also, it is proven that the phase noise in the source has no impact on the final secret key rate. In order to increase the encoding rate, we use broadband homodyne detectors and the no-switching protocol. In a realistic model, we establish a secret key rate of 46.8 kbits/s against collective attacks at an encoding rate of 10 MHz for a 90% channel loss when the modulation variance is optimal.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TH-E-BRE-02: A Forward Scattering Approximation to Dose Calculation Using the Linear Boltzmann Transport Equation

Purpose: To investigate the use of the linear Boltzmann transport equation as a dose calculation tool which can account for interface effects, while still having faster computation times than Monte Carlo methods. In particular, we introduce a forward scattering approximation, in hopes of improving calculation time without a significant hindrance to accuracy. Methods: Two coupled Boltzmann transport equations were constructed, one representing the fluence of photons within the medium, and the other, the fluence of electrons. We neglect the scattering term within the electron transport equation, resulting in an extreme forward scattering approximation to reduce computational complexity. These equations were then solved using a numerical technique for solving partial differential equations, known as a finite difference scheme, where the fluence at each discrete point in space is calculated based on the fluence at the previous point in the particle's path. Using this scheme, it is possible to develop a solution to the Boltzmann transport equations by beginning with boundary conditions and iterating across the entire medium. The fluence of electrons can then be used to find the dose at any point within the medium. Results: Comparisons with Monte Carlo simulations indicate that even simplistic techniques for solving the linear Boltzmann transport equation yield expected interface effects, which many popular dose calculation algorithms are not capable of predicting. Implementation of a forward scattering approximation does not appear to drastically reduce the accuracy of this algorithm. Conclusion: Optimized implementations of this algorithm have been shown to be very accurate when compared with Monte Carlo simulations, even in build up regions where many models fail. Use of a forward scattering approximation could potentially give a reasonably accurate dose distribution in a shorter amount of time for situations where a completely accurate dose distribution is not required, such as in certain optimization algorithms.

97 MATHEMATICS AND COMPUTING↗

MIDA: A Multimodal Imaging-Based Detailed Anatomical Model of the Human Head and Neck

Computational modeling and simulations are increasingly being used to complement experimental testing for analysis of safety and efficacy of medical devices. Multiple voxel- and surface-based whole- and partial-body models have been proposed in the literature, typically with spatial resolution in the range of 1–2 mm and with 10–50 different tissue types resolved. We have developed a multimodal imaging-based detailed anatomical model of the human head and neck, named “MIDA”. The model was obtained by integrating three different magnetic resonance imaging (MRI) modalities, the parameters of which were tailored to enhance the signals of specific tissues: i) structural T1- and T2-weighted MRIs; a specific heavily T2-weighted MRI slab with high nerve contrast optimized to enhance the structures of the ear and eye; ii) magnetic resonance angiography (MRA) data to image the vasculature, and iii) diffusion tensor imaging (DTI) to obtain information on anisotropy and fiber orientation. The unique multimodal high-resolution approach allowed resolving 153 structures, including several distinct muscles, bones and skull layers, arteries and veins, nerves, as well as salivary glands. The model offers also a detailed characterization of eyes, ears, and deep brain structures. A special automatic atlas-based segmentation procedure was adopted to include a detailed map of the nuclei of the thalamus and midbrain into the head model. The suitability of the model to simulations involving different numerical methods, discretization approaches, as well as DTI-based tensorial electrical conductivity, was examined in a case-study, in which the electric field was generated by transcranial alternating current stimulation. The voxel- and the surface-based versions of the models are freely available to the scientific community.

59 BASIC BIOLOGICAL SCIENCES↗

Manual control models of industrial management

The industrial engineer is often required to design and implement control systems and organization for manufacturing and service facilities, to optimize quality, delivery, and yield, and minimize cost. Despite progress in computer science most such systems still employ human operators and managers as real-time control elements. Manual control theory should therefore be applicable to at least some aspects of industrial system design and operations. Formulation of adequate model structures is an essential prerequisite to progress in this area; since real-world production systems invariably include multilevel and multiloop control, and are implemented by timeshared human effort. A modular structure incorporating certain new types of functional element, has been developed. This forms the basis for analysis of an industrial process operation. In this case it appears that managerial controllers operate in a discrete predictive mode based on fast time modelling, with sampling interval related to plant dynamics. Successive aggregation causes reduced response bandwidth and hence increased sampling interval as a function of level.

Crossman, E. R. F. W.↗

Advanced Cogeneration Technology Economic Optimization Study (ACTEOS)

The advanced cogeneration technology economic optimization study (ACTEOS) was undertaken to extend the results of the cogeneration technology alternatives study (CTAS). Cost comparisons were made between designs involving advanced cogeneration technologies and designs involving either conventional cogeneration technologies or not involving cogeneration. For the specific equipment cost and fuel price assumptions made, it was found that: (1) coal based cogeneration systems offered appreciable cost savings over the no cogeneration case, while systems using coal derived liquids offered no costs savings; and (2) the advanced cogeneration systems provided somewhat larger cost savings than the conventional systems. Among the issues considered in the study included: (1) temporal variations in steam and electric demands; (2) requirements for reliability/standby capacity; (3) availability of discrete equipment sizes; (4) regional variations in fuel and electricity prices; (5) off design system performance; and (6) separate demand and energy charges for purchased electricity.

Nanda, P.↗

SPEEDES - A multiple-synchronization environment for parallel discrete-event simulation

Synchronous Parallel Environment for Emulation and Discrete-Event Simulation (SPEEDES) is a unified parallel simulation environment. It supports multiple-synchronization protocols without requiring users to recompile their code. When a SPEEDES simulation runs on one node, all the extra parallel overhead is removed automatically at run time. When the same executable runs in parallel, the user preselects the synchronization algorithm from a list of options. SPEEDES currently runs on UNIX networks and on the California Institute of Technology/Jet Propulsion Laboratory Mark III Hypercube. SPEEDES also supports interactive simulations. Featured in the SPEEDES environment is a new parallel synchronization approach called Breathing Time Buckets. This algorithm uses some of the conservative techniques found in Time Bucket synchronization, along with the optimism that characterizes the Time Warp approach. A mathematical model derived from first principles predicts the performance of Breathing Time Buckets. Along with the Breathing Time Buckets algorithm, this paper discusses the rules for processing events in SPEEDES, describes the implementation of various other synchronization protocols supported by SPEEDES, describes some new ones for the future, discusses interactive simulations, and then gives some performance results.

Steinman, Jeff S.↗

A 3D helical filament surrogate model for 3D tokamak equilibria

A novel approach for efficient representation of three-dimensional (3D) tokamak equilibria is investigated, where a set of helical current filaments occupying the plasma region are employed to resolve deviations from the two-dimensional (2D) axi-symmetric state. A discrete set of 3D filaments, located at rational surfaces for a given toroidal mode number n and following the 2D equilibrium field lines (thus forming closed current loops), are found to provide a surrogate model of 3D equilibria with reasonable accuracy. Specifically, application of the filament model to 3D perturbed equilibria, due to the resonant magnetic perturbation (RMP) in DIII-D and MAST-U discharges, reveals that (1) a single helical filament per rational surface is sufficient; (2) 21 such helical filaments are capable of representing the n = 2 3D response field in MAST-U with less than 10% relative error as compared to that computed by a full magnetohydrodynamic code; (3) optimizing currents (both amplitude and phase) flowing in 3D filaments with fixed geometry, the highest accuracy fitting is found to depend on the characteristics of the 3D equilibria such as the coil current phasing of the RMP coils in our case studies. Here, whis filament approach is also applicable for generating surrogate models of other type of 3D tokamak equilibria, including those during the initial phase of the plasma disruption.

MARS-F↗

Final Report - Summer Visit 2010

During my visit to LLNL during the summer of 2010, I worked on algebraic multilevel solvers for large sparse systems of linear equations arising from discretizations of partial differential equations. The particular solver of interest is based on ILU decomposition. The setup phase for this AMG solve is just the single ILU decomposition, and its corresponding error matrix. Because the ILU uses a minimum degree or similar sparse matrix ordering, most of the fill-in, and hence most of the error, is concentrated in the lower right corner of the factored matrix. All of the major multigrid components - the smoother, the coarse level correction matrices, and the fine-to-coarse and coarse-to-fine rectangular transfer matrices, are defined in terms of various blocks of the ILU factorization. Although such a strategy is not likely to be optimal in terms of convergence properties, it has a relatively low setup cost, and therefore is useful in situations where setup costs for more traditional AMG approaches cannot be amortized over the solution of many linear systems using the same matrix. Such a situation arises in adaptive methods, where often just one linear system is solved at each step of an adaptive feedback loop, or in solving nonlinear equations by approximate Newton methods, where the approximate Jacobian might change substantially from iteration to iteration. In general terms, coarse levels are defined in terms of successively smaller lower right blocks of the matrix, typically decreasing geometrically in order. The most difficult issue was the coarse grid correction matrix. The preconditioner/smoother for a given level is just the corresponding lower right blocks of the ILU factorization. The coarse level matrix itself is just the Schur complement; this matrix is not known exactly using just the ILU decomposition in the setup phase. Thus we approximate this matrix using various combinations of the preconditioning matrix and the error matrix. During my visit, several approximations of this type were implemented and tested. While some improved the convergence rate of the overall method, these gains had to be balanced against the additional costs involved in creating and applying these matrices. By this more stringent criterion, none of the improved approximations could be characterized as an unqualified success.

97 MATHEMATICS AND COMPUTING↗