Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized algorithm”

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 667 records · Page 37

Use of Polarization Lidar for Investigation of Meteorological Formations

This paper presents the results of theoretical and experimental, investigations of depolarization characteristics of different meteorological formations. Experimental investigations are carried out with a monostatic lidar. The ruby laser radiation is polarized in a vertical plane. The radiation reflected is accepted by a lens system of 150 rom in diameter and a viewing angle of 12' and further it is divided by Wollaston prism into the components polarized orthogonally. In this case the principal plane of the prism is exposed parallel with the laser polarization plane. Investigations show the degree of radiation polarization, reflected from water clouds, to be changed within 1/0.7 (seldom up to 0.6) depending on their density. In most cases a signal reflected from the cloud leading edge is polarized completely. The time shift is observed between polarized and crosspolarized components of a Fignal, reflected from a cloud, depending on the density of a meteorological object. While penetrating into the cloud depth a degree of polarization decreases up to 0.8-0.7, and the character of this decrease is different for various types of clouds. For crystal clouds the shift between the components of the reflected signal is not observed and the magnitude of polarization degree amounts to 0.1/0.3 in comparison with water clouds. The polarization degree of radiation reflected by fog is not less than 0.6, and that in the rains of average intensity (about 5 mm/h) is always about 1. The authors have suggested an algorithm of numerical solution of nonstationary transfer equation in the vector form to forecast the influence of multiple scattering effects on polarization characteristics of the lidar light signal. The method of statistical simulation (Monte-Carlo technique) forms the basis of the algorithm. Numerical estimates obtained for a model of stratocumulus at lambda = 0.6943 microns under boundary conditions close to the conditions of natural experiment being discussed proved to be in a good agreement with the results of observation. Specifically, Fig. 1 shows the profiles of polarization (p) versus depth (L) of the following drop formations: fog (curve 1) with horizontal meteorological visibility of 4 km two stratocumulus at a height of 1100 m with the attenuation factors delta = 0.01m(exp -1) (curve 2) and delta = 0.05m(exp -1) (curve 3). Curve 3 shows the results of numerical estimates and the value of their statistical error.

Balin, Yu. S.↗

PSLQ: An Algorithm to Discover Integer Relations

Let x = (x{sub 1}, x{sub 2} {hor_ellipsis}, x{sub n}) be a vector of real or complex numbers. x is said to possess an integer relation if there exist integers a{sub i}, not all zero, such that a{sub 1}x{sub 1} + a{sub 2}x{sub 2} + {hor_ellipsis} + a{sub n}x{sub n} = 0. By an integer relation algorithm, we mean a practical computational scheme that can recover the vector of integers ai, if it exists, or can produce bounds within which no integer relation exists. As we will see in the examples below, an integer relation algorithm can be used to recognize a computed constant in terms of a formula involving known constants, or to discover an underlying relation between quantities that can be computed to high precision. At the present time, the most effective algorithm for integer relation detection is the 'PSLQ' algorithm of mathematician-sculptor Helaman Ferguson [10, 4]. Some efficient 'multi-level' implementations of PSLQ, as well as a variant of PSLQ that is well-suited for highly parallel computer systems, are given in [4]. PSLQ constructs a sequence of integer-valued matrices B{sub n} that reduces the vector y = xB{sub n}, until either the relation is found (as one of the columns of B{sub n}), or else precision is exhausted. At the same time, PSLQ generates a steadily growing bound on the size of any possible relation. When a relation is found, the size of smallest entry of the vector y abruptly drops to roughly 'epsilon' (i.e. 10{sup -p}, where p is the number of digits of precision). The size of this drop can be viewed as a 'confidence level' that the relation is real and not merely a numerical artifact - a drop of 20 or more orders of magnitude almost always indicates a real relation. Very high precision arithmetic must be used in PSLQ. If one wishes to recover a relation of length n, with coefficients of maximum size d digits, then the input vector x must be specified to at least nd digits, and one must employ nd-digit floating-point arithmetic. Maple and Mathematica include multiple precision arithmetic facilities and Maple ships with a full implementation of PSLQ. One may also use any of several freeware multiprecision software packages, for example the ARPREC package by the first author and colleagues at LBNL [7]. In the remaining sections we describe various representative applications of PSLQ. More detail about these examples is given in [8] and the references therein.

97 MATHEMATICS AND COMPUTING↗

A Parallel Solver for Graph Laplacians

Problems from graph drawing, spectral clustering, network flow and graph partitioning can all be expressed in terms of graph Laplacian matrices. There are a variety of practical approaches to solving these problems in serial. However, as problem sizes increase and single core speeds stagnate, parallelism is essential to solve such problems quickly. We present an unsmoothed aggregation multigrid method for solving graph Laplacians in a distributed memory setting. We introduce new parallel aggregation and low degree elimination algorithms targeted specifically at irregular degree graphs. These algorithms are expressed in terms of sparse matrix-vector products using generalized sum and product operations. This formulation is amenable to linear algebra using arbitrary distributions and allows us to operate on a 2D sparse matrix distribution, which is necessary for parallel scalability. Our solver outperforms the natural parallel extension of the current state of the art in an algorithmic comparison. We demonstrate scalability to 576 processes and graphs with up to 1.7 billion edges.

Konolige, Tristan↗

Towards a Verifiable Domain-Specific Language for Hardware-Accelerated Stencils

Defining a domain-specific language (DSL) that supports vector-calculus abstractions eases the porting of partial differential equation (PDE) solvers to specialized architectures. Sufficiently high-level abstractions empower users to express universal laws with sufficient generality that the laws must always hold true within their domain of validity. A broad class of PDE solvers employs stencil-based algorithms, the target domain of Berkeley Lab's stencil accelerator chip co-design project. First released as open-source in January 2026, the Formal software framework lays a foundation for defining an embedded DSL based on composable operators that implement mimetic numerical methods -- stencil algorithms that guarantee satisfaction of discrete versions of important vector calculus theorems. The Formal DSL will be the frontend to a new class of stencil-PDE accelerators developed jointly by LBNL, UHCL, and UC Berkeley through the DOE Competitive Portfolios for Computer Science Project. This offers the potential of an order of magnitude acceleration for this important category of computational methods to serve the DOE mission. Future work on the Formal DSL will facilitate software verification via type-safe templates that enable problem-specific correctness proofs relying upon generic function theory and carefully crafted unit tests.

Rouson, Damian↗

On the Strong Convergence of Forward-Backward Splitting in Reconstructing Jointly Sparse Signals

We consider the problem of reconstructing an infinite set of sparse, finite-dimensional vectors, that share a common sparsity pattern, from incomplete measurements. This is in contrast to the work (Daubechies et al., Pure Appl. Math. 57(11), 1413–1457, 2004), where the single vector signal can be infinite-dimensional, and (Fornasier and Rauhut, SIAM J. Numer. Anal. 46(2), 577613, 2008), which extends the aforementioned work to the joint sparse recovery of finite number of infinite-dimensional vectors. In our case, to take account of the joint sparsity and promote the coupling of nonvanishing components, we employ a convex relaxation approach with mixed norm penalty ℓ 2,1 . This paper discusses the computation of the solutions of linear inverse problems with such relaxation by a forward-backward splitting algorithm. However, since the solution matrix possesses infinitely many columns, the arguments of Daubechies et al. (Pure Appl. Math. 57(11), 1413–1457, 2004) no longer apply. As such, we establish new strong convergence results for the algorithm, in particular when the set of jointly sparse vectors is infinite.

97 MATHEMATICS AND COMPUTING↗

SU-F-BRB-01: How Effective Is Abdominal Compression at Reducing Lung Motion? An Analysis Using Deformable Image Registration Within Different Sub-Regions of the Lung

Purpose: To investigate the effectiveness of employing abdominal compression (AC) in reducing motion for the target region and sub-regions of the lung as part of the planning process for radiation therapy. Methods: Fourteen patients with early lung cancer were scanned with 4DCT and it was determined that target motion exceeded our institutional limit of > 8 mm motion and received a repeat 4DCT with AC. For each 4DCT, deformable image registration (DIR) was used to map the max inhale to the max exhale phase to determine the deformation vector fields (DVF). DIR was performed with Morphons and Demons algorithms. The mean DVF was used to represent that sub-region for each patient. The magnitudes of the mean DVF were quantified for the target and 12 sub-regions in the AP, LR SI directions. The sub-regions were contoured on each lung as (add prefix R or L for lung): Upper-Anterior (UA), Upper-Posterior (UP), Mid-Anterior (MA), Mid-Posterior (MP), Lower-Anterior (LA) and Lower-Posterior (LP). Results: The min/max SI motion for the target on the uncompressed 4DCT was 8mm/24.5 mm. The magnitude of decrease in SI was greatest in the RLP region (3.7±4.0mm) followed by target region (3.3±2.2mm) and finally the LLP region (3.0±3.5mm). The magnitude of decrease in 3D vector followed the same trend; RLP (3.5±2.2mm) then GTV (3.5±2.6mm) then LLP (2.7±3.8mm). 79% of the cases had a SI decrease of >12.5%, 43% had a SI decrease of >25% and 21% had a SI decrease of >50% as compared to the motion on the uncompressed 4DCT. Conclusion: AC is useful in reducing motion with the largest decreases observed in the lower posterior regions of the lungs. However, it should be noted that AC will not greatly decrease motion for all cases as 21% of cases did not reduce SI motion more than 12.5% of initial motion.

60 APPLIED LIFE SCIENCES↗

A Vehicle Management End-to-End Testing and Analysis Platform for Validation of Mission and Fault Management Algorithms to Reduce Risk for NASA's Space Launch System

The engineering development of the new Space Launch System (SLS) launch vehicle requires cross discipline teams with extensive knowledge of launch vehicle subsystems, information theory, and autonomous algorithms dealing with all operations from pre-launch through on orbit operations. The characteristics of these spacecraft systems must be matched with the autonomous algorithm monitoring and mitigation capabilities for accurate control and response to abnormal conditions throughout all vehicle mission flight phases, including precipitating safing actions and crew aborts. This presents a large and complex system engineering challenge, which is being addressed in part by focusing on the specific subsystems involved in the handling of off-nominal mission and fault tolerance with response management. Using traditional model based system and software engineering design principles from the Unified Modeling Language (UML) and Systems Modeling Language (SysML), the Mission and Fault Management (M&FM) algorithms for the vehicle are crafted and vetted in specialized Integrated Development Teams (IDTs) composed of multiple development disciplines such as Systems Engineering (SE), Flight Software (FSW), Safety and Mission Assurance (S&MA) and the major subsystems and vehicle elements such as Main Propulsion Systems (MPS), boosters, avionics, Guidance, Navigation, and Control (GNC), Thrust Vector Control (TVC), and liquid engines. These model based algorithms and their development lifecycle from inception through Flight Software certification are an important focus of this development effort to further insure reliable detection and response to off-nominal vehicle states during all phases of vehicle operation from pre-launch through end of flight. NASA formed a dedicated M&FM team for addressing fault management early in the development lifecycle for the SLS initiative. As part of the development of the M&FM capabilities, this team has developed a dedicated testbed that integrates specific M&FM algorithms, specialized nominal and off-nominal test cases, and vendor-supplied physics-based launch vehicle subsystem models. Additionally, the team has developed processes for implementing and validating these algorithms for concept validation and risk reduction for the SLS program. The flexibility of the Vehicle Management End-to-end Testbed (VMET) enables thorough testing of the M&FM algorithms by providing configurable suites of both nominal and off-nominal test cases to validate the developed algorithms utilizing actual subsystem models such as MPS. The intent of VMET is to validate the M&FM algorithms and substantiate them with performance baselines for each of the target vehicle subsystems in an independent platform exterior to the flight software development infrastructure and its related testing entities. In any software development process there is inherent risk in the interpretation and implementation of concepts into software through requirements and test cases into flight software compounded with potential human errors throughout the development lifecycle. Risk reduction is addressed by the M&FM analysis group working with other organizations such as S&MA, Structures and Environments, GNC, Orion, the Crew Office, Flight Operations, and Ground Operations by assessing performance of the M&FM algorithms in terms of their ability to reduce Loss of Mission and Loss of Crew probabilities. In addition, through state machine and diagnostic modeling, analysis efforts investigate a broader suite of failure effects and associated detection and responses that can be tested in VMET to ensure that failures can be detected, and confirm that responses do not create additional risks or cause undesired states through interactive dynamic effects with other algorithms and systems. VMET further contributes to risk reduction by prototyping and exercising the M&FM algorithms early in their implementation and without any inherent hindrances such as meeting FSW processor scheduling constraints due to their target platform - ARINC 653 partitioned OS, resource limitations, and other factors related to integration with other subsystems not directly involved with M&FM such as telemetry packing and processing. The baseline plan for use of VMET encompasses testing the original M&FM algorithms coded in the same C++ language and state machine architectural concepts as that used by Flight Software. This enables the development of performance standards and test cases to characterize the M&FM algorithms and sets a benchmark from which to measure the effectiveness of M&FM algorithms performance in the FSW development and test processes.

Trevino, Luis↗

Final Report, Center for Programming Models for Scalable Parallel Computing: Co-Array Fortran, Grant Number DE-FC02-01ER25505

The major accomplishment of this project is the production of CafLib, an 'object-oriented' parallel numerical library written in Co-Array Fortran. CafLib contains distributed objects such as block vectors and block matrices along with procedures, attached to each object, that perform basic linear algebra operations such as matrix multiplication, matrix transpose and LU decomposition. It also contains constructors and destructors for each object that hide the details of data decomposition from the programmer, and it contains collective operations that allow the programmer to calculate global reductions, such as global sums, global minima and global maxima, as well as vector and matrix norms of several kinds. CafLib is designed to be extensible in such a way that programmers can define distributed grid and field objects, based on vector and matrix objects from the library, for finite difference algorithms to solve partial differential equations. A very important extra benefit that resulted from the project is the inclusion of the co-array programming model in the next Fortran standard called Fortran 2008. It is the first parallel programming model ever included as a standard part of the language. Co-arrays will be a supported feature in all Fortran compilers, and the portability provided by standardization will encourage a large number of programmers to adopt it for new parallel application development. The combination of object-oriented programming in Fortran 2003 with co-arrays in Fortran 2008 provides a very powerful programming model for high-performance scientific computing. Additional benefits from the project, beyond the original goal, include a programto provide access to the co-array model through access to the Cray compiler as a resource for teaching and research. Several academics, for the first time, included the co-array model as a topic in their courses on parallel computing. A separate collaborative project with LANL and PNNL showed how to extend the co-array model to other languages in a small experimental version of Co-array Python. Another collaborative project defined a Fortran 95 interface to ARMCI to encourage Fortran programmers to use the one-sided communication model in anticipation of their conversion to the co-array model later. A collaborative project with the Earth Sciences community at NASA Goddard and GFDL experimented with the co-array model within computational kernels related to their climate models, first using CafLib and then extending the co-array model to use design patterns. Future work will build on the design-pattern idea with a redesign of CafLib as a true object-oriented library using Fortran 2003 and as a parallel numerical library using Fortran 2008.

97 MATHEMATICS AND COMPUTING↗

Algorithm developments for the Euler equations with calculations of transonic flows

A new algorithm has been developed for the Euler equations that uses flux vector splitting in combination with the concept of rotating the coordinate system to the local streamwise direction. Flux vector biasing is applied along the local streamwise direction and central differencing is used transverse to the flow direction. The flux vector biasing is switched from upwind for supersonic flow to downwind-biased for subsonic flow. This switching is based on the Mach number; hence the proper domain of dependence is used in the supersonic regions and the switching occurs across shock waves. The theoretical basis and the development of the formulas for flux vector splitting are presented. Then several one-dimensional calculations are presented of steady and unsteady transonic flows, which demonstrate the stability and accuracy of the algorithm. Finally results are shown for unsteady transonic flow over an airfoil. The pressure coefficient plots show sharp transonic shock profiles, and the Mach contour plots show smoothly varying contours.

Goorjian, Peter M.↗

Efficient checkpointing schemes for depletion perturbation solutions on memory-limited architectures

We describe a methodology for decreasing the memory footprint and machine I/O load associated with the need to access a forward solution during an adjoint solve. Specifically, we are interested in the depletion perturbation equations, where terms in the adjoint Bateman and transport equations depend on the forward flux solution. Checkpointing is the procedure of storing snapshots of the forward solution to disk and using these snapshots to recompute the parts of the forward solution that are necessary for the adjoint solve. For large problems, however, the storage cost of just a few copies of an angular flux vector can exceed the available RAM on the host machine. We propose a methodology that does not checkpoint the angular flux vector; instead, we write and store converged source moments, which are typically of a much lower dimension than the angular flux solution. This reduces the memory footprint and I/O load of the problem, but requires that we perform single sweeps to reconstruct flux vectors on demand. We argue that this trade-off is exactly the kind of algorithm that will scale on advanced, memory-limited architectures. We analyze the cost, in terms of FLOPS and memory footprint, of five checkpointing schemes. We also provide computational results that support the analysis and show that the memory-for-work trade off does improve time to solution. (authors)

97 MATHEMATICS AND COMPUTING↗

Mission and Navigation Design for the 2009 Mars Science Laboratory Mission

NASA s Mars Science Laboratory mission will launch the next mobile science laboratory to Mars in the fall of 2009 with arrival at Mars occurring in the summer of 2010. A heat shield, parachute, and rocket-powered descent stage, including a sky crane, will be used to land the rover safely on the surface of Mars. The direction of the atmospheric entry vehicle lift vector will be controlled by a hypersonic entry guidance algorithm to compensate for entry trajectory errors and counteract atmospheric and aerodynamic dispersions. The key challenges for mission design are (1) develop a launch/arrival strategy that provides communications coverage during the Entry, Descent, and Landing phase either from an X-band direct-to-Earth link or from a Ultra High Frequency link to the Mars Reconnaissance Orbiter for landing latitudes between 30 deg North and 30 deg South, while satisfying mission constraints on Earth departure energy and Mars atmospheric entry speed, and (2) generate Earth-departure targets for the Atlas V-541 launch vehicle for the specified launch/arrival strategy. The launch/arrival strategy employs a 30-day baseline launch period and a 27-day extended launch period with varying arrival dates at Mars. The key challenges for navigation design are (1) deliver the spacecraft to the atmospheric entry interface point (Mars radius of 3522.2 km) with an inertial entry flight path angle error of +/- 0.20 deg (3 sigma), (2) provide knowledge of the entry state vector accurate to +/- 2.8 km (3 sigma) in position and +/- 2.0 m/s (3 sigma) in velocity for initializing the entry guidance algorithm, and (3) ensure a 99% probability of successful delivery at Mars with respect to available cruise stage propellant. Orbit determination is accomplished via ground processing of multiple complimentary radiometric data types: Doppler, range, and Delta-Differential One-way Ranging (a Very Long Baseline Interferometry measurement). The navigation strategy makes use of up to five interplanetary trajectory correction maneuvers to achieve entry targeting requirements. The requirements for cruise propellant usage and atmospheric entry targeting and knowledge are met with ample margins.

Mission design↗

New Parallel Algorithms for Structural Analysis and Design of Aerospace Structures

Subspace and Lanczos iterations have been developed, well documented, and widely accepted as efficient methods for obtaining p-lowest eigen-pair solutions of large-scale, practical engineering problems. The focus of this paper is to incorporate recent developments in vectorized sparse technologies in conjunction with Subspace and Lanczos iterative algorithms for computational enhancements. Numerical performance, in terms of accuracy and efficiency of the proposed sparse strategies for Subspace and Lanczos algorithm, is demonstrated by solving for the lowest frequencies and mode shapes of structural problems on the IBM-R6000/590 and SunSparc 20 workstations.

Nguyen, Duc T.↗

Novel, Miniature Multi-Hole Probes and High-Accuracy Calibration Algorithms for their use in Compressible Flowfields

Two new calibration algorithms were developed for the calibration of non-nulling multi-hole probes in compressible, subsonic flowfields. The reduction algorithms are robust and able to reduce data from any multi-hole probe inserted into any subsonic flowfield to generate very accurate predictions of the velocity vector, flow direction, total pressure and static pressure. One of the algorithms PROBENET is based on the theory of neural networks, while the other is of a more conventional nature (polynomial approximation technique) and introduces a novel idea of local least-squares fits. Both algorithms have been developed to complete, user-friendly software packages. New technology was developed for the fabrication of miniature multi-hole probes, with probe tip diameters all the way down to 0.035". Several miniature 5- and 7-hole probes, with different probe tip geometries (hemispherical, conical, faceted) and different overall shapes (straight, cobra, elbow probes) were fabricated, calibrated and tested. Emphasis was placed on the development of four stainless-steel conical 7-hole probes, 1/16" in diameter calibrated at NASA Langley for the entire subsonic regime. The developed calibration algorithms were extensively tested with these probes demonstrating excellent prediction capabilities. The probes were used in the "trap wing" wind tunnel tests in the 14'x22' wind tunnel at NASA Langley, providing valuable information on the flowfield over the wing. This report is organized in the following fashion. It consists of a "Technical Achievements" section that summarizes the major achievements, followed by an assembly of journal articles that were produced from this project and ends with two manuals for the two probe calibration algorithms developed.

Rediniotis, Othon K.↗

Global Sensitivity Analysis of Simulated Remote Sensing Polarimetric Observations Over Snow

This study presents a detailed theoretical assessment of the information content of passive polarimetric observations over snow scenes, using a global sensitivity analysis (GSA) method. Conventional sensitivity studies focus on varying a single parameter while keeping all other parameters fixed. In contrast, the GSA correctly addresses the covariance of state parameters across their entire parameter space, hence favoring a more correct interpretation of inversion algorithms and the optimal design of their state vectors. The forward simulations exploit a vector radiative transfer model to obtain the Stokes vector emerging at the top of the atmosphere for different solar zenith angles, when the bottom boundary consists of a vertically resolved snowpack of non-spherical grains. The presence of light-absorbing particulates (LAPs), either embedded in the snow or aloft in the atmosphere above in the form of aerosols, is also considered. The results are presented for a set of wavelengths spanning the visible (VIS), near-infrared (NIR), and shortwave infrared (SWIR) region of the spectrum. The GSA correctly captures the expected, high sensitivity of the reflectance to LAPs in the VIS–NIR and to grain size at different depths in the snowpack in the NIR–SWIR. With adequate viewing geometries, mono-angle measurements of total reflectance in the VIS–SWIR (akin to those of the Moderate Resolution Imaging Spectroradiometer, MODIS) resolve grain size in the top layer of the snowpack sufficiently well. The addition of multi-angle polarimetric observations in the VIS–NIR provides information on grain shape and microscale roughness. The simultaneous sensitivity in the VIS–NIR to both aerosols and snow-embedded impurities can be disentangled by extending the spectral range to the SWIR, which contains information on aerosol optical depth while remaining essentially unaffected when the same particulates are mixed with the snow. Multi-angle polarimetric observations can therefore (i) effectively partition LAPs between the atmosphere and the surface, which represents a notorious challenge for snow remote sensing based on measurements of total reflectance only and (ii) lead to better estimates of grain shape and roughness and, in turn, the asymmetry parameter, which is critical for the determination of albedo. The retrieval uncertainties are minimized when the degree of linear polarization is used in place of the polarized reflectance. The Sobol indices, which are the main metric for the GSA, were used to select the state parameters in retrievals performed on data simulated for multiple instrument configurations. Improvements in retrieval quality with the addition of measurements of polarization, multi-angle views, and different spectral channels reflect the information content, identified by the Sobol indices, relative to each configuration. The results encourage the development of new remote sensing algorithms that fully leverage multi-angle and polarimetric capabilities of modern remote sensors. They can also aid flight planning activities, since the optimal exploitation of the information content of multi-angle measurements depends on the viewing geometry. The better characterization of surface and atmospheric parameters in snow-covered regions advances research opportunities for scientists of the cryosphere and ultimately benefits albedo estimates in climate models.

remote sensing↗

Protein Kinase Classification with 2866 Hidden Markov Models and One Support Vector Machine

The main application considered in this paper is predicting true kinases from randomly permuted kinases that share the same length and amino acid distributions as the true kinases. Numerous methods already exist for this classification task, such as HMMs, motif-matchers, and sequence comparison algorithms. We build on some of these efforts by creating a vector from the output of thousands of structurally based HMMs, created offline with Pfam-A seed alignments using SAM-T99, which then must be combined into an overall classification for the protein. Then we use a Support Vector Machine for classifying this large ensemble Pfam-Vector, with a polynomial and chisquared kernel. In particular, the chi-squared kernel SVM performs better than the HMMs and better than the BLAST pairwise comparisons, when predicting true from false kinases in some respects, but no one algorithm is best for all purposes or in all instances so we consider the particular strengths and weaknesses of each.

Weber, Ryan↗

MiniApp for Density Matrix Renormalization Group Hamiltonian Application Kernel

We present two miniapps that implement the core computational kernel of the DMRG++ application, a generic C++ code that implements the Density Matrix Renormalization Group (DMRG) algorithm. The DMRG++ core Kronecker multiplication kernel is formulated using a batched BLAS approach, with implementation that targets both multi-core CPUs using OpenMP and GPGPU using the MAGMA library. The kernel evaluates the matrix-vector multiplication of the target Hamiltonian matrix used in Lanczos algorithm for computing the lowest eigenvalue and eigenvector. The Hamiltonian matrix is expressed compactly as sums of Kronecker products of small dense matrices. We demonstrate improved performance of the miniapp on synthetic problem, and show the performance of the DMRG++ application using a plugin based on the miniapp. We also present an OpenMP miniapp that explores the use of nested parallel constructs to implement the Kronecker multiplication kernel, exploring the use of nested OpenMP worksharing and tasking abstractions to implement the multi-level parallel multiplication algorithm. The miniapp has been used as a co-design vehicle for evaluating features in the OpenMP-4.5 and upcoming OpenMP-5.0 standards.

Elwasif, Wael↗

Root identification in minirhizotron imagery with multiple instance learning

In this study, multiple instance learning (MIL) algorithms to automatically perform root detection and segmentation in minirhizotron imagery using only image-level labels are proposed. Root and soil characteristics vary from location to location, and thus, supervised machine learning approaches that are trained with local data provide the best ability to identify and segment roots in minirhizotron imagery. However, labeling roots for training data (or otherwise) is an extremely tedious and time-consuming task. This paper aims to address this problem by labeling data at the image level (rather than the individual root or root pixel level) and train algorithms to perform individual root pixel level segmentation using MIL strategies. Three MIL methods (multiple instance adaptive cosine coherence estimator, multiple instance support vector machine, multiple instance learning with randomized trees) were applied to root detection and compared to non-MIL approaches. The results show that MIL methods improve root segmentation in challenging minirhizotron imagery and reduce the labeling burden. In our results, multiple instance support vector machine outperformed other methods. The multiple instance adaptive cosine coherence estimator algorithm was a close second with an added advantage that it learned an interpretable root signature which identified the traits used to distinguish roots from soil and did not require parameter selection.

59 BASIC BIOLOGICAL SCIENCES↗

A fully vectorized numerical solution of the incompressible Navier-Stokes equations

A vectorizable algorithm is presented for the implicit finite difference solution of the incompressible Navier-Stokes equations in general curvilinear coordinates. The unsteady Reynolds averaged Navier-Stokes equations solved are in two dimension and non-conservative primitive variable form. A two-layer algebraic eddy viscosity turbulence model is used to incorporate the effects of turbulence. Two momentum equations and a Poisson pressure equation, which is obtained by taking the divergence of the momentum equations and satisfying the continuity equation, are solved simultaneously at each time step. An elliptic grid generation approach is used to generate a boundary conforming coordinate system about an airfoil. The governing equations are expressed in terms of the curvilinear coordinates and are solved on a uniform rectangular computational domain. A checkerboard SOR, which can effectively utilize the computer architectural concept of vector processing, is used for iterative solution of the governing equations.

Patel, N.↗