Search NASA⌕ Search

SEARCH · Search NASA

Results for “Point 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,279 records · Page 71

An SCF and MCSCF description of the low-lying states of MgO

The paper presents the multiconfiguration-self-consistent (MCSCF) and configuration state functions (CSF) for the low-lying electronic states of MgO. It was shown that simple description of these states was possible provided the 1 Sigma(+) states are individually optimized at the MCSCF level, noting that the 1(3 Sigma)(+) and 2(1 Sigma)(+) states which nominally result from the same electron occupation are separated energetically. The molecular orbitals obtained at this level of approximation should provide a useful starting point for extended configuration interaction calculations since they have been optimized for the particular states of interest.

Bauschlicher, C. W., Jr.↗

Search-based optimization

The problem of determining the minimum cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete (Wang and Jiang, 1994). Traditionally, point estimations of hypothetical ancestral sequences have been used to gain heuristic, upper bounds on cladogram cost. These include procedures with such diverse approaches as non-additive optimization of multiple sequence alignment, direct optimization (Wheeler, 1996), and fixed-state character optimization (Wheeler, 1999). A method is proposed here which, by extending fixed-state character optimization, replaces the estimation process with a search. This form of optimization examines a diversity of potential state solutions for cost-efficient hypothetical ancestral sequences and can result in greatly more parsimonious cladograms. Additionally, such an approach can be applied to other NP-complete phylogenetic optimization problems such as genomic break-point analysis. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.

Non-NASA Center↗

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

Reinforcement Learning for Generating Toolpaths in Additive Manufacturing

Generating toolpaths plays a key role in additive manufacturing processes. In the case of 3-Dimensional (3D) printing, these toolpaths are the pathways the printhead will follow to fabricate a part in a layer-by-layer fashion. Most toolpath generators use nearest neighbor (NN), branch-and-bound, or linear programming algorithms to produce valid toolpaths. These algorithms often produce sub-optimal results or cannot handle large sets of traveling points. In this paper, the researchers at Oak Ridge National Laboratory’s (ORNL) Manufacturing Demonstration Facility (MDF) propose using a machine learning (ML) approach called reinforcement learning (RL) to produce toolpaths for a print. RL is the process of two agents, the player and the critic, learning how to maximize a score based upon the actions of the player in a defined state space. In the context of 3D printing, the player will learn how to find the optimal toolpath that reduces printhead lifts and global print time.

Patrick, Steven↗

3D high-fidelity automated neutronics guided optimization of fusion blanket designs

The compact Fusion Pilot Plant (FPP) is defined in the recent National Academies of Sciences, Engineering, and Medicine report as the next step of fusion energy demonstration with a $50$ MWe peak net electricity production, $Q_e$ greater than $1$, and at least $3$ hours of continuous operation. This fusion pilot plant will be a test bed enabling materials, designs, and fuel management assessment, and it will represent an engineering challenge because of its high-fusion power and compact design targets. Previous reactor data is limited to experiments operating in different design space ranges. Therefore, design iterations and assessments should rely on high-fidelity first-principle theoretical and computational models. The high-fidelity integrated modeling of the plasma is a fundamental part of fusion energy research. However, the whole device modeling is often neglected, utilizing low-fidelity, system-level analysis. Recently, the need for high-fidelity multi-physics modeling was recognized, resulting in a selection of integrated tools. Further, autonomous design optimization requires a streamlined framework that perturbs the design point, reruns the analysis, and examines the outputs. However, high-fidelity analysis requires complex geometry specification that is difficult to perturb. This work presents the parametric CAD generation tool TRACER and a new neutronic workflow. TRACER allows the perturbation of the geometry representation, creating geometry files ready for further analysis. The streamlined neutronic workflow allows efficient and accurate calculations. The two new tools coupled together were used to perform a 3D high-fidelity multi-objective, multi-input optimization of an "ARC Class" compact tokamak design. The workflow was driven by an optimization driver for full automation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The same number of optimized parameters scheme for determining intermolecular interaction energies

We introduce the Same Number Of Optimized Parameters (SNOOP) scheme as an alternative to the counterpoise method for treating basis set superposition errors in calculations of intermolecular interaction energies. The key point of the SNOOP scheme is to enforce that the number of optimized wave function parameters for the noninteracting system is the same as for the interacting system. This ensures a delicate balance between the quality of the monomer and dimer finite basis set calculations. We compare the SNOOP scheme to the uncorrected and counterpoise schemes theoretically as well as numerically. Numerical results for second-order Møller-Plesset perturbation theory (MP2) and coupled-cluster with single, double, and approximate triple excitations (CCSD(T)) show that the SNOOP scheme in general outperforms the uncorrected and counterpoise approaches. Moreover, we iterate that SNOOP interaction energies calculated using a given basis set are of similar quality as those determined by basis set extrapolation of counterpoise-corrected results obtained at a similar computational cost.

74 ATOMIC AND MOLECULAR PHYSICS↗

Optimizing beam transport in rapidly compressing beams on the neutralized drift compression experiment-II

The Neutralized Drift Compression Experiment-II (NDCX-II) is an induction linac that generates intense pulses of 1.2 MeV helium ions for heating matter to extreme conditions. Here, we present recent results on optimizing beam transport. The NDCX-II beamline includes a 1-m-long drift section downstream of the last transport solenoid, which is filled with charge-neutralizing plasma that enables rapid longitudinal compression of an intense ion beam against space-charge forces. The transport section on NDCX-II consists of 28 solenoids. Finding optimal field settings for a group of solenoids requires knowledge of the envelope parameters of the beam. Imaging the beam on the scintillator gives the radius of the beam, but the envelope angle is not measured directly. We demonstrate how the parameters of the beam envelope (radius, envelop angle, and emittance) can be reconstructed from a series of images taken by varying the B-field strengths of a solenoid upstream of the scintillator. We use this technique to evaluate emittance at several points in the NDCX-II beamline and for optimizing the trajectory of the beam at the entry of the plasma-filled drift section.

43 PARTICLE ACCELERATORS↗

Dose-shaping using targeted sparse optimization

Purpose: Dose volume histograms (DVHs) are common tools in radiation therapy treatment planning to characterize plan quality. As statistical metrics, DVHs provide a compact summary of the underlying plan at the cost of losing spatial information: the same or similar dose-volume histograms can arise from substantially different spatial dose maps. This is exactly the reason why physicians and physicists scrutinize dose maps even after they satisfy all DVH endpoints numerically. However, up to this point, little has been done to control spatial phenomena, such as the spatial distribution of hot spots, which has significant clinical implications. To this end, the authors propose a novel objective function that enables a more direct tradeoff between target coverage, organ-sparing, and planning target volume (PTV) homogeneity, and presents our findings from four prostate cases, a pancreas case, and a head-and-neck case to illustrate the advantages and general applicability of our method.Methods: In designing the energy minimization objective (E{sub tot}{sup sparse}), the authors utilized the following robust cost functions: (1) an asymmetric linear well function to allow differential penalties for underdose, relaxation of prescription dose, and overdose in the PTV; (2) a two-piece linear function to heavily penalize high dose and mildly penalize low and intermediate dose in organs-at risk (OARs); and (3) a total variation energy, i.e., the L{sub 1} norm applied to the first-order approximation of the dose gradient in the PTV. By minimizing a weighted sum of these robust costs, general conformity to dose prescription and dose-gradient prescription is achieved while encouraging prescription violations to follow a Laplace distribution. In contrast, conventional quadratic objectives are associated with a Gaussian distribution of violations, which is less forgiving to large violations of prescription than the Laplace distribution. As a result, the proposed objective E{sub tot}{sup sparse} improves tradeoff between planning goals by 'sacrificing' voxels that have already been violated to improve PTV coverage, PTV homogeneity, and/or OAR-sparing. In doing so, overall plan quality is increased since these large violations only arise if a net reduction in E{sub tot}{sup sparse} occurs as a result. For example, large violations to dose prescription in the PTV in E{sub tot}{sup sparse}-optimized plans will naturally localize to voxels in and around PTV-OAR overlaps where OAR-sparing may be increased without compromising target coverage. The authors compared the results of our method and the corresponding clinical plans using analyses of DVH plots, dose maps, and two quantitative metrics that quantify PTV homogeneity and overdose. These metrics do not penalize underdose since E{sub tot}{sup sparse}-optimized plans were planned such that their target coverage was similar or better than that of the clinical plans. Finally, plan deliverability was assessed with the 2D modulation index.Results: The proposed method was implemented using IBM's CPLEX optimization package (ILOG CPLEX, Sunnyvale, CA) and required 1-4 min to solve with a 12-core Intel i7 processor. In the testing procedure, the authors optimized for several points on the Pareto surface of four 7-field 6MV prostate cases that were optimized for different levels of PTV homogeneity and OAR-sparing. The generated results were compared against each other and the clinical plan by analyzing their DVH plots and dose maps. After developing intuition by planning the four prostate cases, which had relatively few tradeoffs, the authors applied our method to a 7-field 6 MV pancreas case and a 9-field 6MV head-and-neck case to test the potential impact of our method on more challenging cases. The authors found that our formulation: (1) provided excellent flexibility for balancing OAR-sparing with PTV homogeneity; and (2) permitted the dose planner more control over the evolution of the PTV's spatial dose distribution than conventional objective functions. In particular, E{sub tot}{sup sparse}-optimized plans for the pancreas case and head-and-neck case exhibited substantially improved sparing of the spinal cord and parotid glands, respectively, while maintaining or improving sparing for other OARs and markedly improving PTV homogeneity. Plan deliverability for E{sub tot}{sup sparse}-optimized plans was shown to be better than their associated clinical plans, according to the two-dimensional modulation index.Conclusions: These results suggest that our formulation may be used to improve dose-shaping and OAR-sparing for complicated disease sites, such as the pancreas or head and neck. Furthermore, our objective function and constraints are linear and constitute a linear program, which converges to the global minimum quickly, and can be easily implemented in treatment planning software. Thus, the authors expect fast translation of our method to the clinic where it may have a positive impact on plan quality for challenging disease sites.

61 RADIATION PROTECTION AND DOSIMETRY↗

Minimal time trajectories for two-level quantum systems with two bounded controls

In this paper we consider the minimum time population transfer problem for a two level quantum system driven by two external fields with bounded amplitude. The controls are modeled as real functions and we do not use the Rotating Wave Approximation. After projection on the Bloch sphere, we treat the time-optimal control problem with techniques of optimal synthesis on 2D manifolds. Based on the Pontryagin Maximum Principle, we characterize a restricted set of candidate optimal trajectories. Properties on this set, crucial for complete optimal synthesis, are illustrated by numerical simulations. Furthermore, when the two controls have the same bound and this bound is small with respect to the difference of the two energy levels, we get a complete optimal synthesis up to a small neighborhood of the antipodal point of the initial condition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A study of the application of singular perturbation theory

A hierarchical real time algorithm for optimal three dimensional control of aircraft is described. Systematic methods are developed for real time computation of nonlinear feedback controls by means of singular perturbation theory. The results are applied to a six state, three control variable, point mass model of an F-4 aircraft. Nonlinear feedback laws are presented for computing the optimal control of throttle, bank angle, and angle of attack. Real Time capability is assessed on a TI 9900 microcomputer. The breakdown of the singular perturbation approximation near the terminal point is examined Continuation methods are examined to obtain exact optimal trajectories starting from the singular perturbation solutions.

Mehra, R. K.↗

Dosimetric Comparison Between Intensity-Modulated with Coplanar Field and 3D Conformal Radiotherapy with Noncoplanar Field for Postocular Invasion Tumor

This study presents a dosimetric optimization effort aiming to compare noncoplanar field (NCF) on 3 dimensions conformal radiotherapy (3D-CRT) and coplanar field (CF) on intensity-modulated radiotherapy (IMRT) planning for postocular invasion tumor. We performed a planning study on the computed tomography data of 8 consecutive patients with localized postocular invasion tumor. Four fields NCF 3D-CRT in the transverse plane with gantry angles of 0-10 deg., 30-45 deg., 240-270 deg., and 310-335 deg. degrees were isocentered at the center of gravity of the target volume. The geometry of the beams was determined by beam's eye view. The same constraints were prepared with between CF IMRT optimization and NCF 3D-CRT treatment. The maximum point doses (D max) for the different optic pathway structures (OPS) with NCF 3D-CRT treatment should differ in no more than 3% from those with the NCF IMRT plan. Dose-volume histograms (DVHs) were obtained for all targets and organ at risk (OAR) with both treatment techniques. Plans with NCF 3D-CRT and CF IMRT constraints on target dose in homogeneity were computed, as well as the conformity index (CI) and homogeneity index (HI) in the target volume. The PTV coverage was optimal with both NCF 3D-CRT and CF IMRT plans in the 8 tumor sites. No difference was noted between the two techniques for the average D{sub max} and D{sub min} dose. NCF 3D-CRT and CF IMRT will yield similar results on CI. However, HI was a significant difference between NCF 3D-CRT and CF IMRT plan (p < 0.001). Physical endpoints for target showed the mean target dose to be low in the CF IMRT plan, caused by a large target dose in homogeneity (p < 0.001). The impact of NCF 3D-CRT versus CF IMRT set-up is very slight. NCF3D-CRT is one of the treatment options for postocular invasion tumor. However, constraints for OARs are needed.

61 RADIATION PROTECTION AND DOSIMETRY↗

An optimization-based integrated controls-structures design methodology for flexible space structures

An approach for an optimization-based integrated controls-structures design is presented for a class of flexible spacecraft that require fine attitude pointing and vibration suppression. The integrated design problem is posed in the form of simultaneous optimization of both structural and control design variables. The approach is demonstrated by application to the integrated design of a generic space platform and to a model of a ground-based flexible structure. The numerical results obtained indicate that the integrated design approach can yield spacecraft designs that have substantially superior performance over a conventional design wherein the structural and control designs are performed sequentially. For example, a 40-percent reduction in the pointing error is observed along with a slight reduction in mass, or an almost twofold increase in the controlled performance is indicated with more than a 5-percent reduction in the overall mass of the spacecraft (a reduction of hundreds of kilograms).

Maghami, Peiman G.↗

A Strawman for an HPC PowerStack

The landscape of High-Performance Computing (HPC) is changing as we enter the exascale era and power and energy management are key design points for any next generation of supercomputers. Efficiently utilizing procured power and optimizing performance of scientific applications under power and energy constraints is challenging due to several reasons including dynamic phase behavior, processor manufacturing variability and increasing heterogeneity of node-level components. Extending the scope from the node- and application-level up to the system-level introduces further challenges on top of power-unaware job scheduling, which is known to be NP-hard on its own. While there exists several individual efforts across the community to research automatic techniques for managing power and energy better, the majority of these techniques have been specialized to meet the needs of a specific HPC center or specific optimization goals and provide little support to connect them to each other. Some projects, most notably the PowerAPI efforts [1], discuss interfaces that form a good starting point for full stack integration, but these interfaces still need to be hooked up to the wide range of software components offered by academic partners, developers or vendors. Furthermore, a recent survey conducted by the EE HPC WG concluded that the majority of such techniques have lacked the application-awareness required to achieve the best system performance and throughput. Other observations were that each technique tended to target management of power and energy for a different subset of the site or system hardware and that the different techniques tended to perform management at different (and often conflicting) granularities. Unfortunately, the existing techniques have not been designed to coexist simultaneously on one site and cooperate on management in an integrated manner [2]. The lack of application-awareness, lack of coordinated management across different granularities, and the lack of widely accepted interfaces and consequent limited connectivity between modules, can result in substantially underutilized Watts and FLOPS. To address these gaps, the HPC community needs a holistic stack for power and energy management and none currently exists. In our view, a holistic stack is one that is extensible enough to support the present and anticipated future needs of various different HPC centers, one that achieves best system performance and throughput through application-awareness, one that is designed to coordinate management at different granularities, and one that enables the seamless integration of software components from different developers and vendors. In this seminar, our goal is bring together experts from academia, research laboratories, and industry in order to take stock of existing approaches, design points and power management concepts and requirements at the various participant’s institutions, and to design concepts for a holistic power and energy management stack, which we refer to as the HPC PowerStack. Further, we hope to take steps toward defining the interfaces necessary for providing a complete prototype shared among many groups. The intention is to align development and research efforts across the community so that we may share development resources, avoid duplicating effort, agree on common interfaces and reap the rewards together as a community. The intended final outcome of this collaboration will be a holistic, flexible and extensible concept of a software stack ecosystem that allows us to combine product-grade open-source software components to enable runtime optimization of system power, energy, and performance.

97 MATHEMATICS AND COMPUTING↗

WE-AB-BRA-12: Post-Implant Dosimetry in Prostate Brachytherapy by X-Ray and MRI Fusion

Purpose: For post-implant dosimetric assessment after prostate brachytherapy, CT-MR fusion approach has been advocated due to the superior accuracy on both seeds localization and soft tissue delineation. However, CT deposits additional radiation to the patient, and seed identification in CT requires manual review and correction. In this study, we propose an accurate, low-dose, and cost-effective post-implant dosimetry approach based on X-ray and MRI. Methods: Implanted seeds are reconstructed using only three X-ray fluoroscopy images by solving a combinatorial optimization problem. The reconstructed seeds are then registered to MR images using an intensity-based points-to-volume registration. MR images are first pre-processed by geometric and Gaussian filtering, yielding smooth candidate seed-only images. To accommodate potential soft tissue deformation, our registration is performed in two steps, an initial affine followed by local deformable registrations. An evolutionary optimizer in conjunction with a points-to-volume similarity metric is used for the affine registration. Local prostate deformation and seed migration are then adjusted by the deformable registration step with external and internal force constraints. Results: We tested our algorithm on twenty patient data sets. For quantitative evaluation, we obtained ground truth seed positions by fusing the post-implant CT-MR images. Seeds were semi-automatically extracted from CT and manually corrected and then registered to the MR images. Target registration error (TRE) was computed by measuring the Euclidean distances from the ground truth to the closest registered X-ray seeds. The overall TREs (mean±standard deviation in mm) are 1.6±1.1 (affine) and 1.3±0.8 (affine+deformable). The overall computation takes less than 1 minute. Conclusion: It has been reported that the CT-based seed localization error is ∼1.6mm and the seed localization uncertainty of 2mm results in less than 5% deviation of prostate D90. The average error of 1.3mm with our system outperforms the CT-based approach and is considered well within the clinically acceptable limit. Supported in part by NIH/NCI grant 5R01CA151395. The X-ray-based implant reconstruction method (US patent No. 8,233,686) was licensed to Acoustic MedSystems Inc.

60 APPLIED LIFE SCIENCES↗

Aerodynamic shape optimization of arbitrary hypersonic vehicles

A new method was developed to optimize, in terms of aerodynamic wave drag minimization, arbitrary (nonaxisymmetric) hypersonic vehicles in modified Newtonian flow, while maintaining the initial volume and length of the vehicle. This new method uses either a surface fitted Fourier series to represent the vehicle's geometry or an independent point motion algorithm. In either case, the coefficients of the Fourier series or the spatial locations of the points defining each cross section were varied and a numerical optimization algorithm based on a quasi-Newton gradient search concept was used to determine the new optimal configuration. Results indicate a significant decrease in aerodynamic wave drag for simple and complex geometries at relatively low CPU costs. In the case of a cone, the results agreed well with known analytical optimum ogive shapes. The procedure is capable of accepting more complex flow field analysis codes.

Dulikravich, George S.↗

Aerodynamic Design Optimization for Natural Laminar Flow Airfoils

Natural laminar flow technology is a passive laminar flow control (LFC) strategy that seeks to delay the onset of boundary-layer transition (BLT) through shape optimization to reduce the drag of the aerodynamic vehicle. Adjoint-based design optimization for LFC is proposed in an integrated multidisciplinary framework, which includes the computational fluid dynamics (CFD), geometry and grid deformation, and linear stability analysis (LSA) for transition prediction. In particular, the BLT location is predicted using the dual N-factor method that is based on a linear stability theory (LST) eigenvalue problem. The dual N-factor criterion accounts for the amplification of planar Tollmien-Schlichting (TS) and stationary crossflow (CF) boundary-layer instabilities to predict the transition location in three-dimensional boundary-layer flows. The adjoint-based shape optimization procedure is based on an iteratively coupled CFD and LSA methodology to converge the transition location and flow solutions, as well as to calculate the sensitivities of the aerodynamic metrics of interest with respect to the flow and shape design parameters. The RAE 2822 airfoil at 0 and 30 degrees yaw angles, an angle of attack of 0.72 degrees, and subsonic conditions (M∞ = 0.19, Rec = 5.6 × 106 ) are used as baseline configurations for design optimization. The angle of attack and the vertical displacement of free-form-deformation control points are used as design variables to reduce the drag coefficient while reaching a specified lift coefficient. The optimized unswept airfoil designs achieve a 30% drag reduction accompanied by a downstream shift of the transition locations over both suction and pressure sides of the airfoil. The initial design iterations for the swept case also show a favorable trend in the drag reduction with transition delay over both sides.

Transition↗

Efficient, direct compilation of SU(N) operations into SNAP & Displacement gates

We present a function which connects the parameter of a previously published short sequence of selective number-dependent arbitrary phase (SNAP) and displacement gates acting on a qudit encoded into the Fock states of a superconducting cavity, $V_k(\alpha)=D(\alpha)R_\pi(k)D(-2\alpha)R_\pi(k)D(\alpha)$ to the angle of the Givens rotation $G(\theta)$ on levels $|k\rangle,|k+1\rangle$ that sequence approximates, namely $\alpha=\Phi(\theta) = \frac{\theta}{4\sqrt{k+1}}$. Previous publications left the determination of an appropriate $\alpha$ to numerical optimization at compile time. The map $\Phi$ gives us the ability to compile directly any $d$-dimensional unitary into a sequence of SNAP and displacement gates in $O(d^3)$ complex floating point operations with low constant prefactor, avoiding the need for numerical optimization. Numerical studies demonstrate that the infidelity of the generated gate sequence $V_k$ per Givens rotation $G$ scales as approximately $O(\theta^6)$. We find numerically that the error on compiled circuits can be made arbitrarily small by breaking each rotation into $m$$\theta/m$ rotations, with the full $d\times d$ unitary infidelity scaling as approximately $O(m^{-4})$. This represents a significant reduction in the computational effort to compile qudit unitaries either to SNAP and displacement gates or to generate them via direct low-level pulse optimization via optimal control.

Job, Joshua↗

Optimal control study for the Space Station Solar Dynamic power module

The authors present the design of an optimal control system for the Space Station Freedom's Solar Dynamic Fine Pointing and Tracking (SDFPT) module. A very large state model of six rigid body modes and 272 flexible modes is used in conjunction with classical LQG optimal control to produce a full-order controller which satisfies the requirements. The results obtained are compared with those of a classically designed PID (proportional plus integral plus derivative) controller that was implemented for a six-rigid-body-mode forty-flexible-mode model. A major difficulty with designing LQG controllers for large models is solving the Riccati equation that arises from the optimal formulation. A Riccati solver based on a Pade approximation to the matrix sign function is used. A symmetric version of this algorithm is derived for the special class of Hamiltonion matrices, thereby yielding, for large problems, a nearly twofold speed increase over a previous algorithm.

Papadopoulos, P. M.↗