Javascript must be enabled to continue!
Lagrange-NG: The next generation of Lagrange
View through CrossRef
A
bstract
Computing ancestral ranges via the Dispersion Extinction and Cladogensis (DEC) model of biogeography is characterized by an exponential number of states relative to the number of regions considered. This is because the DEC model requires computing a large matrix exponential, which typically accounts for up to 80% of overall runtime. Therefore, the kinds of biogeographical analyses that can be conducted under the DEC model are limited by the number of regions under consideration. In this work, we present a completely redesigned efficient version of the popular tool Lagrange which is up to 2.5 times faster, which we call Lagrange-NG (Next Generation). We further reduce time-to-completion by introducing a multi-grained parallelization approach, achieving a total parallel speedup of 8.5 over Lagrange on a machine with 8 cores. In order to validate the correctness of Lagrange-NG, we also introduce a novel metric on range distributions for trees in order to assess the difference between any two range inferences. Finally, Lagrange-NG exhibits substantially higher adherence to coding quality standards. It improves a respective software quality indicator as implemented in the SoftWipe tool from average (5.5; Lagrange) to high (7.8; Lagrange-NG). Lagrange-NG is freely available under GPL2.
Title: Lagrange-NG: The next generation of Lagrange
Description:
A
bstract
Computing ancestral ranges via the Dispersion Extinction and Cladogensis (DEC) model of biogeography is characterized by an exponential number of states relative to the number of regions considered.
This is because the DEC model requires computing a large matrix exponential, which typically accounts for up to 80% of overall runtime.
Therefore, the kinds of biogeographical analyses that can be conducted under the DEC model are limited by the number of regions under consideration.
In this work, we present a completely redesigned efficient version of the popular tool Lagrange which is up to 2.
5 times faster, which we call Lagrange-NG (Next Generation).
We further reduce time-to-completion by introducing a multi-grained parallelization approach, achieving a total parallel speedup of 8.
5 over Lagrange on a machine with 8 cores.
In order to validate the correctness of Lagrange-NG, we also introduce a novel metric on range distributions for trees in order to assess the difference between any two range inferences.
Finally, Lagrange-NG exhibits substantially higher adherence to coding quality standards.
It improves a respective software quality indicator as implemented in the SoftWipe tool from average (5.
5; Lagrange) to high (7.
8; Lagrange-NG).
Lagrange-NG is freely available under GPL2.
Related Results
Lagrange-NG: The next generation of Lagrange
Lagrange-NG: The next generation of Lagrange
Abstract
Computing ancestral ranges via the Dispersion Extinction and Cladogensis (DEC) model of biogeography is characterized by an exponential number of states ...
Informative Lagrange Multipliers in the Nonlinear Parametric Programming Model
Informative Lagrange Multipliers in the Nonlinear Parametric Programming Model
Abstract
The shadow price expresses the marginal cost with respect to the variation of constraints, and it is extremely useful in the sensitivity analysis of nonlinear prog...
Analisis Economic Dispatch PLTU Tanjung Jati B dengan Menggunakan Metode Lagrange dan Particle Swarm Optimization
Analisis Economic Dispatch PLTU Tanjung Jati B dengan Menggunakan Metode Lagrange dan Particle Swarm Optimization
This study examines the application of the Lagrange method and Particle Swarm Optimization (PSO) in solving the Economic Dispatch problem at the Tanjung Jati B Steam Power Plant (P...
A double-hybrid finite element formulation for Stokes flows using a divergence-free approximation space
A double-hybrid finite element formulation for Stokes flows using a divergence-free approximation space
This paper presents a study of Stokes flows using a fully-hybrid finite element formulation. Incompressibility appears in Stokes differential equations as an additional constraint ...
Closed-Form Solution Lagrange Multipliers in Worst-Case Performance Optimization Beamforming
Closed-Form Solution Lagrange Multipliers in Worst-Case Performance Optimization Beamforming
This study presents a method for deriving closed-form solutions for Lagrange multipliers in worst-case performance optimization (WCPO) beamforming. By approximating the array-recei...
New Lagrange Multipliers for the Blind Adaptive Deconvolution Problem Applicable for the Noisy Case
New Lagrange Multipliers for the Blind Adaptive Deconvolution Problem Applicable for the Noisy Case
Recently, a new blind adaptive deconvolution algorithm was proposed based on a new closed-form approximated expression for the conditional expectation (the expectation of the sourc...
Pemrograman Non Linear dengan Pendekatan Separable Programming dan Lagrange Multiplier dalam Penetapan Biaya Produksi Optimal Lanting di “Lanting Bumbu An-Nisa”
Pemrograman Non Linear dengan Pendekatan Separable Programming dan Lagrange Multiplier dalam Penetapan Biaya Produksi Optimal Lanting di “Lanting Bumbu An-Nisa”
Penelitian ini bertujuan untuk menerapkan masalah pemrograman nonlinear dalam menetapkan biaya produksi optimal lanting di “Lanting Bumbu An-Nisa” dengan pendekatan Separable Progr...
Optimal control of a class of pseudo Euler‐Lagrange systems
Optimal control of a class of pseudo Euler‐Lagrange systems
SummaryThis paper presents a solution of the optimal control problem for a class of pseudo Euler‐Lagrange systems and proposes a systematic approach to find a Lyapunov function for...

