Block rapid extension method based on smallest-structure singular subsets
A subset and block technology, applied in complex mathematical operations, etc., can solve problems such as inability to obtain optimal offset values
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0035] The preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
[0036] figure 1 It is a flow chart of the method described in the present invention, as shown in the figure, the block rapid extension method based on the minimum structural singular subset includes the following steps: Step 1: Convert the sparse high-order DAE system generated by the multiphysics model into Σ Matrix; Step 2: Decompose the block upper triangular matrix on the Σ matrix into: in Step 3: For each independent block upper triangular matrix Σ i , using the block fast extension method to obtain its optimal offset vector; Step 4: by each Σ i The local optimal offset vector of the matrix constitutes the overall optimal offset vector of the Σ matrix, transforms the DAE system into an ODE system, and finds out the constraint equation of the consistent initial point value.
[0037] The principle of the block fast extension method...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com