An official website of the United States government
We develop a novel mathematical and computational framework for geometric optimization of mesh-like devices such as stents, based on modeling mesh-like structures as networks of one-dimensional curved rods. To simplify calculations, the curved rods are approximated by piecewise straight rods. Constrained optimization problems for different cost functionals are stated and mathematically analyzed. The cost functionals considered include: (1) stents' compliance, (2) norm of displacement, (3) norm of contact moment (which is related to fatigue), and (4) multicriteria optimization in which stents are optimized to achieve maximal radial stiffness and minimal bending rigidity. The optimization parameters are stent's vertices, namely, the location of points where the stent struts meet. Existence of solutions to the mathematically posed optimization problems is obtained, and a numerical method based on the gradient descent algorithm is proposed to find the solutions. Three representative stents' geometries are numerically analyzed to show that the optimization algorithms provide tangible solutions. The stent geometries considered are those of Palmaz type stents, single zig-zag stent rings, and Express type stents. Interesting findings are obtained, including several new stent designs. Several optimized stents are presented, including an optimized Palmaz stent with a reduction in contact moment of 30%, and optimized Express and Palmaz stents with a reduction in compliance by more than 70%.
more »
« less
Local bilinear computation of Jacobi sets
Abstract We propose a novel method for the computation of Jacobi sets in 2D domains. The Jacobi set is a topological descriptor based on Morse theory that captures gradient alignments among multiple scalar fields, which is useful for multi-field visualization. Previous Jacobi set computations use piecewise linear approximations on triangulations that result in discretization artifacts like zig-zag patterns. In this paper, we utilize a local bilinear method to obtain a more precise approximation of Jacobi sets by preserving the topology and improving the geometry. Consequently, zig-zag patterns on edges are avoided, resulting in a smoother Jacobi set representation. Our experiments show a better convergence with increasing resolution compared to the piecewise linear method. We utilize this advantage with an efficient local subdivision scheme. Finally, our approach is evaluated qualitatively and quantitatively in comparison with previous methods for different mesh resolutions and across a number of synthetic and real-world examples.
more »
« less
- Award ID(s):
- 1910733
- PAR ID:
- 10371581
- Publisher / Repository:
- Springer Science + Business Media
- Date Published:
- Journal Name:
- The Visual Computer
- Volume:
- 38
- Issue:
- 9-10
- ISSN:
- 0178-2789
- Page Range / eLocation ID:
- p. 3435-3448
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Soft pneumatic actuators (SPAs) offer a promising alternative for biomedical applications requiring high sensitivity and precise manipulation due to their inherent compliance. 3D- printed multi-modal zig-zag SPAs exhibit potential in this area by achieving repeatable and precise shape changes due to their chambered design. However, achieving accurate position control remains a challenge. This work proposes a hybrid control strategy for multi-modal zig-zag SPAs that combines feed-forward and proportional-integral-derivative (PID) control to enhance positioning accuracy. A Pseudo Rigid Body (PRB) based inverse dynamic model is employed for the feed-forward component. The effectiveness of the controller is evaluated through extensive simulations and experiments. Results demonstrate that the hybrid control strategy achieves up to 29.5% and 31.6% improvement in accuracy compared to the PID and feed-forward controllers, respectively, within the operational bandwidth.more » « less
-
This work concerns the local convergence theory of Newton and quasi-Newton methods for convex-composite optimization: where one minimizes an objective that can be written as the composition of a convex function with one that is continuiously differentiable. We focus on the case in which the convex function is a potentially infinite-valued piecewise linear-quadratic function. Such problems include nonlinear programming, mini-max optimization, and estimation of nonlinear dynamics with non-Gaussian noise as well as many modern approaches to large-scale data analysis and machine learning. Our approach embeds the optimality conditions for convex-composite optimization problems into a generalized equation. We establish conditions for strong metric subregularity and strong metric regularity of the corresponding set-valued mappings. This allows us to extend classical convergence of Newton and quasi-Newton methods to the broader class of nonfinite valued piecewise linear-quadratic convex-composite optimization problems. In particular, we establish local quadratic convergence of the Newton method under conditions that parallel those in nonlinear programming.more » « less
-
Reliable computational methodologies and basis sets for modeling x-ray spectra are essential for extracting and interpreting electronic and structural information from experimental x-ray spectra. In particular, the trade-off between numerical accuracy and computational cost due to the size of the basis set is a major challenge, since molecular orbitals undergo extreme relaxation in the core-hole state. To gain clarity on the changes in electronic structure induced by the formation of a core-hole, the use of sufficiently flexible basis for expanding the orbitals, particularly for the core region, has been shown to be essential. This work focuses on the refinement of core-hole ionized state calculations using the equation-of-motion coupled cluster family of methods through an extensive analysis on the effectiveness of “hybrid” and mixed basis sets. In this investigation, we utilize the CVS-EOMIP-CCSD method in combination and construct hybrid basis sets piecewise from readily available Dunning’s correlation consistent basis sets in order to calculate x-ray ionization energies (IEs) for a set of small gas phase molecules. Our results provide insights into the impact of basis sets on the CVS-EOMIP-CCSD calculations of K-edge IEs of first-row p-block elements. These insights enable us to understand more about the basis set dependence of the core IEs computed and allow us to establish a protocol for deriving reliable and cost-effective theoretical estimates for computing IEs of small molecules containing such elements.more » « less
-
Abstract In this paper we present an efficient active-set method for the solution of convex quadratic programming problems with general piecewise-linear terms in the objective, with applications to sparse approximations and risk-minimization. The algorithm is derived by combining a proximal method of multipliers (PMM) with a standard semismooth Newton method (SSN), and is shown to be globally convergent under minimal assumptions. Further local linear (and potentially superlinear) convergence is shown under standard additional conditions. The major computational bottleneck of the proposed approach arises from the solution of the associated SSN linear systems. These are solved using a Krylov-subspace method, accelerated by certain novel general-purpose preconditioners which are shown to be optimal with respect to the proximal penalty parameters. The preconditioners are easy to store and invert, since they exploit the structure of the nonsmooth terms appearing in the problem’s objective to significantly reduce their memory requirements. We showcase the efficiency, robustness, and scalability of the proposed solver on a variety of problems arising in risk-averse portfolio selection,$$L^1$$ -regularized partial differential equation constrained optimization, quantile regression, and binary classification via linear support vector machines. We provide computational evidence, on real-world datasets, to demonstrate the ability of the solver to efficiently and competitively handle a diverse set of medium- and large-scale optimization instances.more » « less
