Search NASA⌕ Search

SEARCH · Search NASA

Results for “Scientific Computing.”

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 289 records · Page 16

Efficient Memory Access with NumPy Global Arrays using Local Memory Access

This paper discusses the work completed working with Global Arrays of data on distributed multi-computer systems and improving their performance. The tasks completed were done at Pacific Northwest National Laboratory in the Science Undergrad Laboratory Internship program in the summer of 2013 for the Data Intensive Computing Group in the Fundamental and Computational Sciences DIrectorate. This work was done on the Global Arrays Toolkit developed by this group. This toolkit is an interface for programmers to more easily create arrays of data on networks of computers. This is useful because scientific computation is often done on large amounts of data sometimes so large that individual computers cannot hold all of it. This data is held in array form and can best be processed on supercomputers which often consist of a network of individual computers doing their computation in parallel. One major challenge for this sort of programming is that operations on arrays on multiple computers is very complex and an interface is needed so that these arrays seem like they are on a single computer. This is what global arrays does. The work done here is to use more efficient operations on that data that requires less copying of data to be completed. This saves a lot of time because copying data on many different computers is time intensive. The way this challenge was solved is when data to be operated on with binary operations are on the same computer, they are not copied when they are accessed. When they are on separate computers, only one set is copied when accessed. This saves time because of less copying done although more data access operations were done.

Daily, Jeffrey A.↗

Evaluating Application Resilience with XRay

The rising count and shrinking feature size of transistors within modern computers is making them increasingly vulnerable to various types of soft faults. This problem is especially acute in high-performance computing (HPC) systems used for scientific computing, because these systems include many thousands of compute cores and nodes, all of which may be utilized in a single large-scale run. The increasing vulnerability of HPC applications to errors induced by soft faults is motivating extensive work on techniques to make these applications more resilient to such faults, ranging from generic techniques such as replication or checkpoint/restart to algorithm-specific error detection and tolerance techniques. Effective use of such techniques requires a detailed understanding of how a given application is affected by soft faults to ensure that (i) efforts to improve application resilience are spent in the code regions most vulnerable to faults and (ii) the appropriate resilience technique is applied to each code region. This paper presents XRay, a tool to view the application vulnerability to soft errors, and illustrates how XRay can be used in the context of a representative application. In addition to providing actionable insights into application behavior XRay automatically selects the number of fault injection experiments required to provide an informative view of application behavior, ensuring that the information is statistically well-grounded without performing unnecessary experiments.

97 MATHEMATICS AND COMPUTING↗

Artificial Intelligence-Enhanced, Multi-Level, Modular System Design

As Moore’s Law and Dennard Scaling come to an end, it is becoming increasingly important to develop non-von Neumann computing architectures that can perform low-power computing in the domains of scientific computing, artificial intelligence, embedded systems, and edge computing. Next-generation computing technologies, such as neuromorphic computing and quantum computing, have the potential to revolutionize computing. However, in order to make progress in these fields, it is necessary to fundamentally change the current computing paradigm by codesigning systems across all system level, from materials to software. Because skilled labor is limited in the field of next-generation computing, we are developing artificial intelligence-enhanced tools to automate the codesign and co-discovery of next-generation computers. Here, we develop a method called Modular and Multi-level MAchine Learning (MAMMAL) which is able to perform analog codesign and co-discovery across multiple system levels, spanning devices to circuits. We prototype MAMMAL by using it to design simple passive analog low-pass filters. We also explore methods to incorporate uncertainty quantification into MAMMAL and to accelerate MAMMAL by using emerging technologies, such as crossbar arrays. Ultimately, we believe that MAMMAL will enable rapid progress in developing next-generation computers by automating the codesign and co-discovery of electronic systems.

97 MATHEMATICS AND COMPUTING↗

ASCR Report on a Quantum Computing Testbed for Science

This report details the findings of the Quantum Testbed Stakeholder Workshop sponsored by the Department of Energy’s Advanced Scientific Computing Research Program to identify opportunities and challenges in establishing a quantum testbed to advance quantum computing hardware and software systems that will enable science investigations. The workshop was help on February 14 – 16, 2017 in Washington DC and served as a forum for individual stakeholders from academia, industry, national laboratories, and government to provide their perspectives and ideas on the overarching goals and objectives of a quantum testbed, technical considerations, and how a quantum testbed program would be synergistic with other nascent quantum computing efforts in the US and worldwide. This report summarizes discussions on best practices for management of various types of collaborative research activities, including topics such as workforce training and building strong relationships with the research community. It also reviews specific technologies that have been identified by the ASCR Program as being important for the success of a quantum testbed whose overall goal is advancing quantum computing for scientific applications in the next five years.

97 MATHEMATICS AND COMPUTING↗

Investigations of Beam Dynamics Issues at Current and Future Hadron Accelerators (Final Report)

There is a synergy between the fields of Beam Dynamics (BD) in modern particle accelerators and Applied Mathematics (AMa). We have formulated significant problems in BD and have developed and applied tools within the contexts of dynamical systems, topological methods, numerical analysis and scientific computing, probability and stochastic processes, and mathematical statistics. We summarize the three main areas of our AMa work since 2011. First, we continued our study of Vlasov-Maxwell systems. Previously, we developed a state of the art algorithm and code (VM3@A) to calculate coherent synchrotron radiation in single pass systems. In this cycle we carefully analyzed the major expense, namely the integral-over-history (IOH), and developed two approaches to speed up integration. The first strategy uses a representation of the Bessel function J0 in terms of exponentials. The second relies on “local sequences” developed recently for radiation boundary conditions, which are used to reduce computational domains. Although motivated by practicality, both strategies involve interesting and rather deep analysis and approximation theory. As an alternative to VM3@A, we are integrating Maxwell’s equations by a time-stepping method, bypass- ing the IOH, using a Discontinuous Galerkin (DG) method. DG is a generalization of Finite Element and Finite Volume methods. It is spectrally convergent, unlike the commonly used Finite Difference methods, and can handle complicated vacuum chamber geometries. We have applied this in several contexts and have obtained very nice results including an explanation of an experiment at the Canadian Light Source, where the geometry is quite complex. Second, we continued our study of spin dynamics in storage rings. There is much current and proposed activity where spin polarized beams are being used in testing the Standard Model and its modifications. Our work has focused on invariant spin fields (ISFs) and amplitude dependent spin tunes (ADSTs), which are essential for estimating beam polarization. Several algorithms have been developed since the 1980s for computing the ISF, among them the Heinemann- Hoffstaetter method of stroboscopic averaging (SA) which is implemented in the code SPRINT. SA, which computes the ISF by using spin tracking data, can find the ISF to computer precision if it exists and thus can give evidence for existence of the ISF. Central to our work is resolving the ISF conjecture, which says that, off orbital resonance, an ISF exists. Thus Heinemann developed, in his 2010 PhD thesis, a new framework which unifies and generalizes the notions of ISF and ADST by using bundle theory. This lead to a long paper which was a major collaborative effort during the recent cycle. In a nutshell, our bundle approach elegantly unifies the dynamics of spin-1/2 and spin-1 particles, e.g., protons and deuterons. In fact it is well known that these two kinds of dynamics are driven by the same spin transfer matrix and in our approach one sees the deeper reason for this: the spin transfer matrix carries the natural dynamics of a principal bundle whereas the difference between the spin-1/2 and spin-1 dynamics lies in their different geometrical situation, i.e., different underlying associated bundles. Thus one arrives at new results for polarized beams, among them the Invariant Reduction Theorem (IRT) and the Cross Section Theorem (CST). The IRT gives a necessary and sufficient condition for the ISF to exist. The SA technique revealed, 20 years ago, that each ISF can be viewed as a complex agglomerate of spin tracking data. The bundle approach goes one step further by using the IRT and the CST to glue spin tracking data into agglomerates which are candidates for ISFs. We gain insight because the “good” agglomerates, in the presence of an ISF, are very different from the “bad” ones. Finally we mention that the bundle approach has analogies to the approach used in geometrical Yang-Mills theory. Third, we studied X-Ray Free Electron Lasers (FELs), which are electron accelerators producing coherent undulator radiation over a wide range of frequencies from microwaves to x-rays. The photon beams produced in FEL undulators are used to study material samples in biology, material science etc. We developed a mathematical analysis, based on the 6D Lorentz system, of energetic electrons moving through a planar undulator excited by a Maxwell traveling wave field of wavelength λ. Our Method of Averaging perturbation analysis yields non-resonant and near-to-resonant normal form approximations as a function of λ, which we present in two averaging theorems. We prove the theorems in detail, error bounds and giving a tutorial on mathematically rigorous perturbation theory in a context where proofs are easily understood. To our knowledge the planar problem has not been analyzed with the generality here nor has the standard FEL pendulum system, which appears on resonance, been derived with error bounds. In addition to the domains of validity of the normal forms we obtain new insights that require further study, including a more general low gain theory. With a firm foundation in the non-collective case above we are studying the 3D collective case from start up from noise to high gain and saturation. We have formulated the noise start up as a problem of going from the microscopic Klimontovich-Maxwell to the macroscopic Vlasov-Maxwell with a Vlasov correction term. In the 1D setting, we seek an alternative to the phenomenological Vlasov approach which models shot noise by a perturbation on an initial “smooth” density. The 1D wave equation with a Klimontovich source is often the starting point for the 1D FEL high gain theory. We have a new representation of solutions which may lead to new insights.

43 PARTICLE ACCELERATORS↗

Computer Science Research Needs for Parallel Discrete Event Simulation (PDES)

Historically, scientific computing efforts have demonstrated the clear need for, and effective use of, supercomputing with traditional time-stepped simulations. Nevertheless, there are several areas in the mission spaces of the U.S. Department of Energy and other agencies waiting to tap advanced computing research using a different, discrete event style of modeling, simulation, and analysis. These span a wide spectrum of applications including energy grid resilience, urban planning and policy, transportation science, building technologies, emergency response and planning, environmental impact analysis, computational epidemiology, Internet communications, cyber security, and cyber-physical systems, to name only a few. Even within traditional scientific applications, the role of discrete event modes of execution is increasing in the form of new event-based mathematical solvers such as quantized state integration methods and discrete-continuous hybrid system solvers. Co-design of advanced supercomputing hardware systems is another area that exploits discrete event simulation at its core for effective analyses. Complex systems, entity behaviors and interconnections play a significant role in all these applications, which are mapped to large-scale models with discrete event formulations. To make advancements in all the aforementioned scientific areas, many technical aspects need to be more thoroughly studied and deeply understood in parallel discrete event simulation (PDES). The unique dynamics inherent in a discrete event modeling approach, by their very nature, intersect and influence the entire stack of the computing system, including (a) the unique nature of the instruction sets exercised in PDES workloads without a predominance of high-precision floating point operations, (b) virtual time-constrained multi-threaded execution of many logical processes per processor, (c) extremely variable and difficult to predict network traffic characteristics, (d) interfaces and inter-dependencies with machine learning and artificial intelligence codes at higher software layers, and (e) highly challenging load balancing needs, especially in effectively accounting for accelerated/extremely heterogeneous computing in current and future high-performance computing systems. Efficient and accurate parallel execution of PDES workloads is also dominated by challenges in dealing with their asynchronous concurrency fundamentally present at the model level. Conservative synchronization, optimistic/speculative synchronization, and their hybrid schemes open new questions in fundamental computer science with respect to reversibility of computation and prediction (lookahead) of behaviors inherent within model codes. On the implementation front, there are relatively few scalable, general-purpose parallel discrete event simulators in the world, and even fewer have been studied on emerging hardware platforms. To enable scientific advances using PDES, the research needs in computer science must also be pursued and met in the intersection of the algorithmic and hardware-aware aspects of scalable PDES engines. This report is aimed at capturing a computer science-oriented view of this important area of research in PDES, presenting a sample of important applications with their inherent discrete event technology elements. Needs are outlined in core areas of parallel discrete event research as well as cross-cutting directions in computer science research that positively impact scientific advancements across several important application areas. A selection of priority research opportunities in advanced computing for PDES is identified to serve as reference for key research topics and their order of importance for scientific advancements.

97 MATHEMATICS AND COMPUTING↗

Modeling and Simulation of High Dimensional Stochastic Multiscale PDE Systems at the Exascale

The thrust of the proposal was to exploit modern data-mining tools in a way that will create a systematic, computer-assisted approach to the representation of random media -- and also to the representation of the solutions of an array of important physicochemical processes that take place in/on such media. A parsimonious representation/parametrization of the random media links directly (via uncertainty quantification tools) to good sampling of the distribution of random media realizations. It also links directly to modern multiscale computational algorithms (like the equation-free approach that has been developed in our group) and plays a crucial role in accelerating the scientific computation of solutions of nonlinear PDE models (deterministic or stochastic) in such media – both solutions in particular realizations of the random media, and estimation of the statistics of the solutions over multiple realizations (e.g. expectations).

97 MATHEMATICS AND COMPUTING↗

Position Papers for the 2024 ASCR Workshop on Energy-Efficient Computing for Science

On behalf of the Advanced Scientific Computing Research (ASCR) program in the US Department of Energy (DOE) Office of Science, we are organizing a Workshop on Energy-Efficient Computing for Science (EECS). Energy efficiency involves coordination across all the interoperating components of a computing system—in particular, applications, algorithms, system software, programming models, data management, and the hardware on which they run. Looking 10-15 years into the future, the goal is to dramatically lower the energy costs of the computational platforms (from the data center to the edge) serving DOE science while expanding the capabilities of these systems, broadening their applicability to science challenges of interest to DOE and the nation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Position Papers for the ASCR Workshop on Reimagining Codesign

On behalf of the Advanced Scientific Computing Research (ASCR) program in the US Department of Energy (DOE) Office of Science, we are organizing a Workshop on Reimagining Codesign (ReCoDe). Codesign is the process of jointly designing interoperating components of a computing system—in particular: applications, algorithms, system software, programming models, and the hardware on which they run. The goal is to maximize the overall performance, efficiency, and other desirable qualities of the system as a whole. Codesign is a standard methodology in the embedded-systems community, where space, power, and cost constraints are commonly pitted against execution speed for a tightly constrained feature set. Over the last decade, the DOE has invested in codesign efforts to foster the development of exascale computing systems for broad classes of scientific and engineering applications. The ReCoDe workshop hopes to explore how scientific applications of interest to the DOE can be accelerated through close interactions with hardware designers and software-stack developers, in which all components adapt to each other’s requirements and constraints. We want to answer the question of what are the key tools and methodologies for accomplishing codesign in today’s computing landscape, and what will be the highest impact targets for meeting DOE’s emerging mission requirements. This workshop aims to bring together DOE, industry, and academia to identify opportunities to build on past codesign successes and identify new areas that are either emerging or that may need reimagining for the future. We want to continue to find opportunities that can be pursued as a joint effort and continue to break down the traditional customer/vendor dichotomy with true partnerships. From this work, DOE will benefit from increased application performance relative to what stock hardware or existing general-purpose roadmaps can provide, and vendors will benefit from expanding their hardware’s capabilities to address needs they might have not otherwise anticipated and thereby create more widespread interest in their products. The workshop will be structured around a set of breakout sessions, with every attendee expected to participate actively in the discussions. Afterward, workshop attendees—from DOE, industry, and academia—will produce a report for ASCR that summarizes the findings made during the workshop.

97 MATHEMATICS AND COMPUTING↗

Density Functional Theory Study of Surface Carbonate Formation on BaO(001)

Periodic density functional theory calculations have been used to study the formation and stability of surface carbonate on BaO(001) upon CO 2 exposures. CO 2 adsorbs at Lewis basic O s site forming anionic surface carbonate (CO 3 -δ ) species until one monolayer coverage (1ML). Certain amount of electrons has been transferred from the surface to CO 2 after CO 2 adsorption. The adsorption energy of CO 2 decreases with the increasing coverage as a combinative result of the less electrons accepted by each adsorbed CO 2 and the lateral repulsive interactions. At θ CO2 < 0.75 ML, surface carbonates in the perpendicular pattern are energetically more stable than those in the parallel pattern. At θ CO2 > 0.75 ML, dramatic surface reconstruction had been found for the parallel pattern of surface carbonates that initially arranged on BaO(001). Due to strong lateral repulsion between the surface carbonates, the surface reconstruction actually pulls the surface Ba atom out of the surface plane, suggesting a possible onset of phase transition from surface carbonate overlayer to crystalline bulk-like barium carbonate. Surface free energy calculations have been performed to study the stability of surface carbonate at different temperature and pressure conditions. Our calculations indicate that surface carbonates decompose at 850 K at low coverage. For the fully covered carbonate overlayer, surface carbonate will become unstable at about 600 K. This is in good agreement with previous experimental observations. Finally, the effect of surface hydroxyl on the stability of surface carbonate is investigated. At low hydroxyl coverage, the neighboring hydroxyl stabilizes surface carbonate. On the fully hydroxylated BaO surface, the chelating bicarbonate instead of surface carbonate is formed upon CO 2 adsorption. This work, performed in the Institute for Interfacial Catalysis at Pacific Northwest National Laboratory (PNNL), was partially supported by a PNNL Laboratory Directed Research and Development (LDRD) project. Computing time was granted by the National Energy Research Scientific Computing Center (NERSC) under project No. m752, and also by the scientific user project (st30469) using the Molecular Science Computing Facility in the William R. Wiley Environmental Molecular Sciences Laboratory (EMSL). The EMSL is a U.S. DOE national scientific user facility located at PNNL, and supported by the DOE’s Office of Biological and Environmental Research.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

HPC resource integration into CMS Computing via HEPCloud

The higher energy and luminosity from the LHC in Run 2 have put increased pressure on CMS computing resources. Extrapolating to even higher luminosities (and thus higher event complexities and trigger rates) beyond Run 3, it becomes clear that simply scaling up the the current model of CMS computing alone will become economically unfeasible. High Performance Computing (HPC) facilities, widely used in scientific computing outside of HEP, have the potential to help fill the gap. Here we describe the U.S.CMS efforts to integrate US HPC resources into CMS Computing via the HEPCloud project at Fermilab. We present advancements in our ability to use NERSC resources at scale and efforts to integrate other HPC sites as well. We present experience in the elastic use of HPC resources, quickly scaling up use when so required by CMS workflows. We also present performance studies of the CMS multi-threaded framework on both Haswell and KNL HPC resources.

97 MATHEMATICS AND COMPUTING↗

CMS use of allocation based HPC resources

The higher energy and luminosity from the LHC in Run2 has put increased pressure on CMS computing resources. Extrapolating to even higher luminosities (and thus higher event complexities and trigger rates) in Run3 and beyond, it becomes clear the current model of CMS computing alone will not scale accordingly. High Performance Computing (HPC) facilities, widely used in scientific computing outside of HEP, present a (at least so far) largely untapped computing resource for CMS. Even just being able use a small fraction of HPC facilities computing resources could significantly increase the overall computing available to CMS. Here we describe the CMS strategy for integrating HPC resources into CMS computing, the unique challenges these facilities present, and how we plan on overcoming these challenges. We also present the current status of ongoing CMS efforts at HPC sites such as NERSC (Cori cluster), SDSC (Comet cluster) and TACC (Stampede cluster).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

PETSc Users Manual (Rev. 3.3)

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication. PETSc includes an expanding suite of parallel linear, nonlinear equation solvers and time integrators that may be used in application codes written in Fortran, C, C++, Python, and MATLAB (sequential). PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++ or Fortran and experience using a debugger such as gdb or dbx, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than “rolling them” yourself; For many tasks a package such as MATLAB is often the best tool; PETSc is not intended for the classes of problems for which effective MATLAB code can be written. PETSc also has a MATLAB interface, so portions of your code can be written in MATLAB to “try out” the PETSc solvers. The resulting code will not be scalable however because currently MATLAB is inherently not scalable; and PETSc should not be used to attempt to provide a “parallel linear solver” in an otherwise sequential code. Certainly all parts of a previously sequential code need not be parallelized but the matrix generation portion must be parallelized to expect any kind of reasonable performance. Do not expect to generate your matrix sequentially and then “use PETSc” to solve the linear system in parallel. Since PETSc is under continued development, small changes in usage and calling sequences of routines will occur. PETSc is supported; see the web site http://www.mcs.anl.gov/petsc for information on contacting support. A http://www.mcs.anl.gov/petsc/publications may be found a list of publications and web sites that feature work involving PETSc. We welcome any reports of corrections for this document.

97 MATHEMATICS AND COMPUTING↗

PETSc Users Manual (Rev. 3.4)

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication. PETSc includes an expanding suite of parallel linear, nonlinear equation solvers and time integrators that may be used in application codes written in Fortran, C, C++, Python, and MATLAB (sequential). PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++ or Fortran and experience using a debugger such as gdb or dbx, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than “rolling them” yourself; For many tasks a package such as MATLAB is often the best tool; PETSc is not intended for the classes of problems for which effective MATLAB code can be written. PETSc also has a MATLAB interface, so portions of your code can be written in MATLAB to “try out” the PETSc solvers. The resulting code will not be scalable however because currently MATLAB is inherently not scalable; and PETSc should not be used to attempt to provide a “parallel linear solver” in an otherwise sequential code. Certainly all parts of a previously sequential code need not be parallelized but the matrix generation portion must be parallelized to expect any kind of reasonable performance. Do not expect to generate your matrix sequentially and then “use PETSc” to solve the linear system in parallel. Since PETSc is under continued development, small changes in usage and calling sequences of routines will occur. PETSc is supported; see the web site http://www.mcs.anl.gov/petsc for information on contacting support. A http://www.mcs.anl.gov/petsc/publications may be found a list of publications and web sites that feature work involving PETSc. We welcome any reports of corrections for this document.

97 MATHEMATICS AND COMPUTING↗

PETSc Users Manual (Rev. 3.5)

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication. PETSc includes an expanding suite of parallel linear, nonlinear equation solvers and time integrators that may be used in application codes written in Fortran, C, C++, Python, and MATLAB (sequential). PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++ or Fortran and experience using a debugger such as gdb or dbx, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than “rolling them” yourself. ;For many tasks a package such as MATLAB is often the best tool; PETSc is not intended for the classes of problems for which effective MATLAB code can be written. PETSc also has a MATLAB interface, so portions of your code can be written in MATLAB to “try out” the PETSc solvers. The resulting code will not be scalable however because currently MATLAB is inherently not scalable; and PETSc should not be used to attempt to provide a “parallel linear solver” in an otherwise sequential code. Certainly all parts of a previously sequential code need not be parallelized but the matrix generation portion must be parallelized to expect any kind of reasonable performance. Do not expect to generate your matrix sequentially and then “use PETSc” to solve the linear system in parallel. Since PETSc is under continued development, small changes in usage and calling sequences of routines will occur. PETSc is supported; see the web site http://www.mcs.anl.gov/petsc for information on contacting support. A http://www.mcs.anl.gov/petsc/publications may be found a list of publications and web sites that feature work involving PETSc. We welcome any reports of corrections for this document.

97 MATHEMATICS AND COMPUTING↗

PETSc Users Manual Revision 3.7

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication.

97 MATHEMATICS AND COMPUTING↗

PETSc Users Manual Revision 3.8

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication.

97 MATHEMATICS AND COMPUTING↗

PETSc Users Manual (Rev. 3.11)

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication.

97 MATHEMATICS AND COMPUTING↗