Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solving”

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,567 records · Page 87

Extension of the Bissell-Johnson plasma-sheath model for application to fusion-relevant and general plasmas

This article presents an approach to solving a special Fredholm-type integral equation of the first kind with a particular kernel containing a modified Bessel function for applications in plasma physics. From the physical point of view, the problem was defined by Bissell and Johnson (B and J) [Phys. Fluids 30, 779 (1987)] as a task to find the potential profile and the ion velocity distribution function in a plane-parallel discharge with a Maxwellian ion source. The B and J model is a generalization of the well-known Tonks-Langmuir (T and L) [Phys. Rev. 34, 876 (1929)] discharge model characterized by a ''cold'' ion source. Unlike the T and L model, which can be readily solved analytically, attempts to solve the B and J model with a ''warm'' ion source have been done only numerically. However, the validity of numerical solutions up to date remains constrained to a rather limited range of a crucial independent parameter of the B and J integral equation, which mathematically is the width of a Gaussian distribution and physically represents the ion temperature. It was solved only for moderately warm ion sources. This paper presents the exact numerical solution of the B and J model, which is valid without any restriction regarding the above-mentioned parameter. It is shown that the ion temperature is very different from the temperature of the ion source. The new results with high-temperature ion sources are not only of particular importance for understanding and describing the plasma-sheath boundary in fusion plasmas, but are of considerable interest for discharge problems in general. The eigenvalue of the problem, found analytically by Harrison and Thompson [Proc. Phys. Soc. 74, 145 (1959)] for the particular case of a cold ion source, is here extended to arbitrary ion-source temperatures.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Micro-Crystallography Developments at GM/CA-CAT at the APS

Recently, several important structures have been solved using micro-crystallographic techniques that previously could not have been solved with conventional crystallography. At GM/CA-CAT we continue to develop micro-crystallographic capabilities for difficult problems such as small crystals of large macromolecular complexes or membrane proteins grown in the lipidic cubic phase. This paper will describe three major upgrades to our arsenal of tools, 'mini-beam' collimators, active beamstop, and an improved goniostat. Our 'mini-beam' collimators have evolved to a new triple-collimator fabricated from molybdenum as a uni-body. This has significantly improved the robustness, ease of initial alignment, and reduction of background. More recently, two prototypes of a quad-collimator have been developed and fabricated to provide a selection of mini-beams of 5, 10, 20 {mu}m and a 300 {mu}m scatter-guard on a single body. The smaller beams and samples have increased the demand on the tolerances of our goniostat. To meet these challenges we have designed and implemented a goniostat with a 1-micron peak-to-peak sphere of confusion. This is a significant improvement over the previous 6 micron sphere of confusion of the commercially available air-bearing and XY stages. Finally, an 'active beamstop' has been constructed. This will provide non-invasive, real time feedback at the sample during data collection.

43 PARTICLE ACCELERATORS↗

Numerical calculation of neoclassical distribution functions and current profiles in low collisionality, axisymmetric plasmas

A new code, the Neoclassical Ion-Electron Solver (NIES), has been written to solve for stationary, axisymmetric distribution functions (f) in the conventional banana regime for both ions and electrons using a set of drift-kinetic equations (DKEs) with linearized Fokker-Planck-Landau collision operators. Solvability conditions on the DKEs determine the relevant non-adiabatic pieces of f (called h). We work in a 4D phase space in which {psi} defines a flux surface, {theta} is the poloidal angle, v is the magnitude of the velocity referenced to the mean flow velocity, and {lambda} is the dimensionless magnetic moment parameter. We expand h in finite elements in both v and {lambda}. The Rosenbluth potentials, {Phi} and {Psi}, which define the integral part of the collision operator, are expanded in Legendre series in cos{chi}, where {chi} is the pitch angle, Fourier series in cos{theta}, and finite elements in v. At each {psi}, we solve a block tridiagonal system for h{sub i} (independent of f{sub e}), then solve another block tridiagonal system for h{sub e} (dependent on f{sub i}). We demonstrate that such a formulation can be accurately and efficiently solved. NIES is coupled to the MHD equilibrium code JSOLVER [J. DeLucia et al., J. Comput. Phys. 37, 183-204 (1980)] allowing us to work with realistic magnetic geometries. The bootstrap current is calculated as a simple moment of the distribution function. Results are benchmarked against the Sauter analytic formulas and can be used as a kinetic closure for an MHD code (e.g., M3D-C{sup 1}[S. C. Jardin et al., Comput. Sci. Discovery 5, 014002 (2012)]).

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Extending molecular simulation time scales: Parallel in time integrations for high-level quantum chemistry and complex force representations

Parallel in time simulation algorithms are presented and applied to conventional molecular dynamics (MD) and ab initio molecular dynamics (AIMD) models of realistic complexity. Assuming that a forward time integrator, f (e.g., Verlet algorithm), is available to propagate the system from time t{sub i} (trajectory positions and velocities x{sub i} = (r{sub i}, v{sub i})) to time t{sub i+1} (x{sub i+1}) by x{sub i+1} = f{sub i}(x{sub i}), the dynamics problem spanning an interval from t{sub 0}…t{sub M} can be transformed into a root finding problem, F(X) = [x{sub i} − f(x{sub (i−1})]{sub i} {sub =1,M} = 0, for the trajectory variables. The root finding problem is solved using a variety of root finding techniques, including quasi-Newton and preconditioned quasi-Newton schemes that are all unconditionally convergent. The algorithms are parallelized by assigning a processor to each time-step entry in the columns of F(X). The relation of this approach to other recently proposed parallel in time methods is discussed, and the effectiveness of various approaches to solving the root finding problem is tested. We demonstrate that more efficient dynamical models based on simplified interactions or coarsening time-steps provide preconditioners for the root finding problem. However, for MD and AIMD simulations, such preconditioners are not required to obtain reasonable convergence and their cost must be considered in the performance of the algorithm. The parallel in time algorithms developed are tested by applying them to MD and AIMD simulations of size and complexity similar to those encountered in present day applications. These include a 1000 Si atom MD simulation using Stillinger-Weber potentials, and a HCl + 4H{sub 2}O AIMD simulation at the MP2 level. The maximum speedup ((serial execution time)/(parallel execution time) ) obtained by parallelizing the Stillinger-Weber MD simulation was nearly 3.0. For the AIMD MP2 simulations, the algorithms achieved speedups of up to 14.3. The parallel in time algorithms can be implemented in a distributed computing environment using very slow transmission control protocol/Internet protocol networks. Scripts written in Python that make calls to a precompiled quantum chemistry package (NWChem) are demonstrated to provide an actual speedup of 8.2 for a 2.5 ps AIMD simulation of HCl + 4H{sub 2}O at the MP2/6-31G* level. Implemented in this way these algorithms can be used for long time high-level AIMD simulations at a modest cost using machines connected by very slow networks such as WiFi, or in different time zones connected by the Internet. The algorithms can also be used with programs that are already parallel. Using these algorithms, we are able to reduce the cost of a MP2/6-311++G(2d,2p) simulation that had reached its maximum possible speedup in the parallelization of the electronic structure calculation from 32 s/time step to 6.9 s/time step.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Accident analysis of heavy water cooled thorium breeder reactor

Thorium has lately attracted considerable attention because it is accumulating as a by-product of large scale rare earth mining. The objective of research is to analyze transient behavior of a heavy water cooled thorium breeder that is designed by Tokai University and Tokyo Institute of Technology. That is oxide fueled, PWR type reactor with heavy water as primary coolant. An example of the optimized core has relatively small moderator to fuel volume ratio (MFR) of 0.6 and the characteristics of the core are burn-up of 67 GWd/t, breeding ratio of 1.08, burn-up reactivity loss during cycles of < 0.2% dk/k, and negative coolant reactivity coefficient. One of the nuclear reactor accidents types examined here is Unprotected Transient over Power (UTOP) due to withdrawing of the control rod that result in the positive reactivity insertion so that the reactor power will increase rapidly. Another accident type is Unprotected Loss of Flow (ULOF) that caused by failure of coolant pumps. To analyze the reactor accidents, neutron distribution calculation in the nuclear reactor is the most important factor. The best expression for the neutron distribution is the Boltzmann transport equation. However, solving this equation is very difficult so that the space-time diffusion equation is commonly used. Usually, space-time diffusion equation is solved by employing a point kinetics approach. However, this approach is less accurate for a spatially heterogeneous nuclear reactor and the nuclear reactor with quite large reactivity input. Direct method is therefore used to solve space-time diffusion equation which consider spatial factor in detail during nuclear reactor accident simulation. Set of equations that obtained from full implicit finite-difference method is solved by using iterative methods. The indication of UTOP accident is decreasing macroscopic absorption cross-section that results large external reactivity, and ULOF accident is indicated by decreasing coolant flow. The power reactor has a peak value before reactor has new balance condition. The analysis showed that temperatures of fuel and claddings during accident are still below limitations which are in secure condition.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Solvent effect on polystyrene surface roughness on top of QCM sensor

Quartz Crystal Microbalance (QCM) has been used as a basis for many chemical sensors and biosensor. Its sensitivity to mass change which can detect a mass change on its surface down to sub ng/cm2 is one of its interesting aspects. Another interesting feature is its ability to work in liquid environment. However, there are many aspects which influence QCM sensor properties in contact with liquid. One of the aspects is surface roughness of the matrix layer where on top of it a biological sensitive layer will be immobilized. One of matrix layers in the immobilizing biological sensitive layer was polystyrene. Polystyrene was coated on the QCM sensor by using the spin coating method. During the coating process, polystyrene was solved using non-polar solvent. It is known that the physical and chemical properties of the solvent affect a transition process from soluble polymer becoming rigid polymer layer. In this work, we show that polystyrene solved in chloroform has a higher surface roughness compare to one solved in toluene, xylene, or tetrahydrofuran. Surface roughness of the polystyrene coating were measured using a non-contact profilometer. However, we also found that there is no difference on the electrical impedance of the QCM sensor coated with polystyrene resulted from differing solvent when the sensor was in contact with air and water. Thus, all of the mentioned solvent can be used to solve the polystyrene as a coating material for QCM sensor without affecting the electrical performance of the sensor, but the choice of the solution can be used as a simple method to control the difference roughness of the polystyrene coating.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Analysis of non-equilibrium phenomena in inductively coupled plasma generators

This article addresses the modeling of non-equilibrium phenomena in inductively coupled plasma discharges. In the proposed computational model, the electromagnetic induction equation is solved together with the set of Navier-Stokes equations in order to compute the electromagnetic and flow fields, accounting for their mutual interaction. Semi-classical statistical thermodynamics is used to determine the plasma thermodynamic properties, while transport properties are obtained from kinetic principles, with the method of Chapman and Enskog. Particle ambipolar diffusive fluxes are found by solving the Stefan-Maxwell equations with a simple iterative method. Two physico-mathematical formulations are used to model the chemical reaction processes: (1) A Local Thermodynamics Equilibrium (LTE) formulation and (2) a thermo-chemical non-equilibrium (TCNEQ) formulation. In the TCNEQ model, thermal non-equilibrium between the translational energy mode of the gas and the vibrational energy mode of individual molecules is accounted for. The electronic states of the chemical species are assumed in equilibrium with the vibrational temperature, whereas the rotational energy mode is assumed to be equilibrated with translation. Three different physical models are used to account for the coupling of chemistry and energy transfer processes. Numerical simulations obtained with the LTE and TCNEQ formulations are used to characterize the extent of non-equilibrium of the flow inside the Plasmatron facility at the von Karman Institute. Each model was tested using different kinetic mechanisms to assess the sensitivity of the results to variations in the reaction parameters. A comparison of temperatures and composition profiles at the outlet of the torch demonstrates that the flow is in non-equilibrium for operating conditions characterized by pressures below 30 000 Pa, frequency 0.37 MHz, input power 80 kW, and mass flow 8 g/s.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Properties of coupled-cluster equations originating in excitation sub-algebras

In this paper we discuss properties of single-reference coupled cluster (CC) equations associated with the existence of nilpotent sub-algebras of excitations that allow one to represent CC equations in a hybrid fashion where the cluster amplitudes associated with these sub-algebras can be obtained by solving corresponding eigenvalue problem. For closed-shell formulations analyzed in this paper, the hybrid representation of CC equations provides a natural way for extending concepts behind actives-spaces and seniority numbers to provide more accurate description of electron correlation effects. Moreover, new representation can be utilized to re-define iterative algorithms used to solve CC equations, especially for though cases defined by the presence of strong static and dynamic correlation effects. We will also explore invariance properties associated with the nilpotent sub-algebras to define a new class of CC approximations referred in this paper to as the nilpotent-flow-based CC methods. We illustrate the performance of these methods on the example of ground- and excited-state calculations for commonly used small benchmark systems.

Kowalski, Karol↗

Mathematical solutions in internal dose assessment: A comparison of Python-based differential equation solvers in biokinetic modeling

Abstract In biokinetic modeling systems employed for radiation protection, biological retention and excretion have been modeled as a series of discretized compartments representing the organs and tissues of the human body. Fractional retention and excretion in these organ and tissue systems have been mathematically governed by a series of coupled first-order ordinary differential equations (ODEs). The coupled ODE systems comprising the biokinetic models are usually stiff due to the severe difference between rapid and slow transfers between compartments. In this study, the capabilities of solving a complex coupled system of ODEs for biokinetic modeling were evaluated by comparing different Python programming language solvers and solving methods with the motivation of establishing a framework that enables multi-level analysis. The stability of the solvers was analyzed to select the best performers for solving the biokinetic problems. A Python-based linear algebraic method was also explored to examine how the numerical methods deviated from an analytical or semi-analytical method. Results demonstrated that customized implicit methods resulted in an enhanced stable solution for the inhaled 60 Co (Type M) and 131 I (Type F) exposure scenarios for the inhalation pathway of the International Commission on Radiological Protection (ICRP) Publication 130 Human Respiratory Tract Model (HRTM). The customized implementation of the Python-based implicit solvers resulted in approximately consistent solutions with the Python-based matrix exponential method ( expm ). The differences generally observed between the implicit solvers and expm are attributable to numerical precision and the order of numerical approximation of the numerical solvers. This study provides the first analysis of a list of Python ODE solvers and methods by comparing their usage for solving biokinetic models using the ICRP Publication 130 HRTM and provides a framework for the selection of the most appropriate ODE solvers and methods in Python language to implement for modeling the distribution of internal radioactivity.

61 RADIATION PROTECTION AND DOSIMETRY↗

Implicit and coupled fluid plasma solver with adaptive Cartesian mesh and its applications to non-equilibrium gas discharges

In this work, we present a new fluid plasma solver with adaptive Cartesian mesh (ACM) based on a full-Newton (nonlinear, implicit) scheme for non-equilibrium gas discharge plasma. The electrons and ions are described using drift-diffusion approximation coupled to Poisson equation for the electric field. The electron-energy transport equation is solved to account for electron thermal conductivity, Joule heating, and energy loss of electrons in collisions with neutral species. The rate of electron-induced ionization is a function of electron temperature and could also depend on electron density (important for plasma stratification). The ion and gas temperature are kept constant. The transport equations are discretized using a non-isothermal Scharfetter-Gummel scheme to resolve possible large temperature gradients in the sheaths. We demonstrate the new solver for simulations of direct current (DC) and radiofrequency (RF) discharges. The implicit treatment of the coupled equations allows using large time steps. The full-Newton method (FNM) enables fast nonlinear convergence at each time step, offering significantly improved simulation efficiency. We discuss the selection of time steps for solving different plasma problems. The new solver enables solving several problems we could not solve before with existing software: two- and three-dimensional structures of the entire DC discharges including cathode and anode regions, electric field reversals and double-layer formation, the normal cathode spot and an anode ring, moving striations in diffuse and constricted DC discharges, and standing striations in RF discharges. The developed FNM-ACM technique offers many benefits for tackling the disparity of gas discharge plasma systems' time scales and nonlinearity.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization

Abstract An algorithm for solving smooth nonconvex optimization problems is proposed that, in the worst-case, takes ${\mathscr O}(\varepsilon ^{-3/2})$ iterations to drive the norm of the gradient of the objective function below a prescribed positive real number $\varepsilon $ and can take ${\mathscr O}(\varepsilon ^{-3})$ iterations to drive the leftmost eigenvalue of the Hessian of the objective above $-\varepsilon $. The proposed algorithm is a general framework that covers a wide range of techniques including quadratically and cubically regularized Newton methods, such as the Adaptive Regularization using Cubics (arc) method and the recently proposed Trust-Region Algorithm with Contractions and Expansions (trace). The generality of our method is achieved through the introduction of generic conditions that each trial step is required to satisfy, which in particular allows for inexact regularized Newton steps to be used. These conditions center around a new subproblem that can be approximately solved to obtain trial steps that satisfy the conditions. A new instance of the framework, distinct from arc and trace, is described that may be viewed as a hybrid between quadratically and cubically regularized Newton methods. Numerical results demonstrate that our hybrid algorithm outperforms a cubically regularized Newton method.

Mathematics↗

An efficient algorithm for simulating ensembles of parameterized flow problems

Abstract Many applications of computational fluid dynamics require multiple simulations of a flow under different input conditions. In this paper, a numerical algorithm is developed to efficiently determine a set of such simulations in which the individually independent members of the set are subject to different viscosity coefficients, initial conditions and/or body forces. The proposed scheme, when applied to the flow ensemble, needs to solve a single linear system with multiple right-hand sides, and thus is computationally more efficient than solving for all the simulations separately. We show that the scheme is nonlinearly and long-term stable under certain conditions on the time-step size and a parameter deviation ratio. A rigorous numerical error estimate shows the scheme is of first-order accuracy in time and optimally accurate in space. Several numerical experiments are presented to illustrate the theoretical results.

Mathematics↗

Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark

The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. We propose an input model called the Random Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast inversion, preconditioned quantum linear system solvers, fast Green's-function computation, and fast evaluation of matrix functions

Preconditioning is the most widely used and effective way for treating ill-conditioned linear systems in the context of classical iterative linear system solvers. We introduce a quantum primitive called fast inversion, which can be used as a preconditioner for solving quantum linear systems. The key idea of fast inversion is to directly block encode a matrix inverse through a quantum circuit implementing the inversion of eigenvalues via classical arithmetics. We demonstrate the application of preconditioned linear system solvers for computing single-particle Green's functions of quantum many-body systems, which are widely used in quantum physics, chemistry, and materials science. We analyze the complexities in three scenarios: the Hubbard model, the quantum many-body Hamiltonian in the plane-wave-dual basis, and the Schwinger model. We also provide a method for performing Green's function calculation in second quantization within a fixed-particle manifold and note that this approach may be valuable for simulation more broadly. Aside from solving linear systems, fast inversion also allows us to develop fast algorithms for computing matrix functions, such as the efficient preparation of Gibbs states. Furthermore, we introduce two efficient approaches for such a task, based on the contour-integral formulation and the inverse transform, respectively.

97 MATHEMATICS AND COMPUTING↗

Quantum advantage for differential equation analysis

Quantum algorithms for differential equation solving, data processing, and machine learning potentially offer an exponential speedup over all known classical algorithms. However, there also exist obstacles to obtaining this potential speedup in useful problem instances. The essential obstacle for quantum differential equation solving is that outputting useful information may require difficult postprocessing, and the essential obstacle for quantum data processing and machine learning is that inputting the data is a difficult task just by itself. In this study, we demonstrate that, when combined, these difficulties solve one another. We show how the output of quantum differential equation solving can serve as the input for quantum data processing and machine learning, allowing dynamical analysis in terms of principal components, power spectra, and wavelet decompositions. To illustrate this, we consider continuous-time Markov processes on epidemiological and social networks. These quantum algorithms provide an exponential advantage over existing classical Monte Carlo methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Realizability-preserving discontinuous Galerkin method for spectral two-moment radiation transport in special relativity

Here we present a realizability-preserving numerical method for solving a spectral two-moment model to simulate the transport of massless, neutral particles interacting with a steady background material moving with relativistic velocities. The model is obtained as the special relativistic limit of a four-momentum-conservative general relativistic two-moment model. Using a maximum-entropy closure, we solve for the Eulerian-frame energy and momentum. The proposed numerical method is designed to preserve moment realizability, which corresponds to moments defined by a nonnegative phase-space density. The realizability-preserving method is achieved with the following key components: (i) a discontinuous Galerkin phase-space discretization with specially constructed numerical fluxes in the spatial and energy dimensions; (ii) a strong stability-preserving implicit-explicit time-integration method; (iii) a realizability-preserving conserved to primitive moment solver; (iv) a realizability-preserving implicit collision solver; and (v) a realizability-enforcing limiter. Component (iii) is necessitated by the closure procedure, which closes higher order moments nonlinearly in terms of primitive moments. The nonlinear conserved to primitive and the implicit collision solves are formulated as fixed-point problems, which are solved with custom iterative solvers designed to preserve the realizability of each iterate. With a series of numerical tests, we demonstrate the accuracy and robustness of this discontinuous-Galerkin-implicit-explicit method.

79 ASTRONOMY AND ASTROPHYSICS↗

Parallelized traveling cluster approximation to study numerically spin-fermion models on large lattices

Lattice spin-fermion models are quite important to study correlated systems where quantum dynamics allows for a separation between slow and fast degrees of freedom. The fast degrees of freedom are treated quantum mechanically while the slow variables, generically referred to as the “spins,” are treated classically. At present, exact diagonalization coupled with classical Monte Carlo (ED + MC) is extensively used to solve numerically a general class of lattice spin-fermion problems. In this common setup, the classical variables (spins) are treated via the standard MC method while the fermion problem is solved by exact diagonalization. The “traveling cluster approximation” (TCA) is a real space variant of the ED + MC method that allows to solve spin-fermion problems on lattice sizes with up to 10 3 sites. In this paper, we present a novel reorganization of the TCA algorithm in a manner that can be efficiently parallelized. Finally, this allows us to solve generic spin-fermion models easily on 10 4 lattice sites and with some effort on 10 5 lattice sites, representing the record lattice sizes studied for this family of models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Advances in Rosetta structure prediction for difficult molecular-replacement problems

Modeling advances using Rosetta structure prediction to aid in solving difficult molecular-replacement problems are discussed. Recent work has shown the effectiveness of structure-prediction methods in solving difficult molecular-replacement problems. The Rosetta protein structure modeling suite can aid in the solution of difficult molecular-replacement problems using templates from 15 to 25% sequence identity; Rosetta refinement guided by noisy density has consistently led to solved structures where other methods fail. In this paper, an overview of the use of Rosetta for these difficult molecular-replacement problems is provided and new modeling developments that further improve model quality are described. Several variations to the method are introduced that significantly reduce the time needed to generate a model and the sampling required to improve the starting template. The improvements are benchmarked on a set of nine difficult cases and it is shown that this improved method obtains consistently better models in less running time. Finally, strategies for best using Rosetta to solve difficult molecular-replacement problems are presented and future directions for the role of structure-prediction methods in crystallography are discussed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗