9 results about "Fast algorithm" patented technology

The present application relates to the technical field of pipeline engineering safety monitoring and state evaluation, and discloses a kind of liquid-solid two-phase flow based on tee pipeline erosion defect fast algorithm, comprising: S1, along the inner wall of the tee pipeline of metal material in liquid-solid two-phase conveying system axial and circumferential, potential erosion area is discretely divided, form several independent erosion unit, define equivalent topographic feature parameter vector for each erosion unit, for corresponding pipe wall area erosion defect geometry state is characterized;S2, sensor is arranged at the preset monitoring position of tee pipeline, and multiple-source physical response signals and the like in the running process of tee pipeline are collected;The method realizes accurate inversion and dynamic evolution prediction of erosion defect under limited information by erosion defect parameterization modeling, running response mapping construction, online rapid inversion and consistency correction, solves the problems of low calculation efficiency, poor engineering applicability and insufficient evaluation accuracy of prior art.

The application relates to a real-time splicing method for core drilling images, and belongs to the field of image processing.The method comprises the following steps: for any two adjacent core drilling images, respectively adopting a FAST algorithm to quickly detect corner points, and adopting a Harris algorithm to remove weak corner points and reserve true corner points with high response values to obtain two true corner point images; adopting a quadtree division method to realize uniform distribution of the true corner points in each true corner point image, and adopting a non-maximum suppression method to screen high-quality corner points; adopting a fast approximate nearest neighbor matcher to perform initial matching on the high-quality corner points in the two images to obtain a plurality of initial matching pairs; adopting a homography geometric consistency inlier purification algorithm based on sparse feature points to perform accurate matching on the plurality of initial matching pairs to obtain an optimized homography matrix; and splicing the two adjacent core drilling images according to the optimized homography matrix.The application guarantees the real-time performance and accuracy of the splicing of the core drilling development images.

This invention provides a rapid prediction method for lunar orbit rendezvous guidance, achieving high-precision and rapid prediction to meet mission requirements. The prediction method of this invention applies the gravitational field acceleration calculation method used for GPS autonomous orbit determination of Earth orbit satellites to the field of lunar orbit rendezvous. Addressing the problems that the algorithm cannot be directly applied to the design of lunar orbit rendezvous guidance strategies, improvements and upgrades are made one by one, resulting in a high-precision and rapid algorithm suitable for lunar orbit rendezvous flight control missions to meet mission requirements. Specifically, this invention is the first to transplant this algorithm to the field of lunar orbit applications, which is unprecedented. Considering the special characteristics of the lunar gravitational field, where the acceleration measures of various gravitational perturbations are of similar order and cannot be approximated by the J2 term alone, the J22 term perturbation acceleration is added to the algorithm, thereby significantly improving the computational accuracy and numerical stability of the algorithm.

The application discloses a CPU double-path acceleration method for large-scale LLM sparse matrix multiplication, and relates to the technical field of high-performance computing. The method first constructs a fast matrix multiplication algorithm lookup table, generates an optimized algorithm through random walk and performs Hensel promotion to compensate for numerical errors; then performs two-stage division and zero block identification on the weight matrix, classifies it into complete zero blocks, near-zero blocks and dense blocks; then aggregates non-zero elements for the near-zero blocks and merges dense blocks into large blocks using dynamic programming; uses multi-core CPU to concurrently perform sparse path and dense path calculation, respectively calls sparse kernels and matching fast algorithms, and finally fuses the results based on position mapping using vector instructions. The application solves the problem of low utilization of unstructured sparse matrices through double-path shunting strategy and software and hardware co-optimization, significantly improves the calculation throughput and hardware resource utilization while ensuring the model accuracy.

A kind of multi-source shortest path method based on bidirectional SPFA, comprising: according to the traffic road network map of obtained construction directed weighted graph;Obtain multi-source shortest path query request;Select specific node as pre-processing starting point, calculate the shortest distance of pre-processing starting point to all other nodes using shortest path fast algorithm, construct and initialize the evaluation function array;For each shortest path query request, empty the node scheduling queue for storing pending node and reset each auxiliary array;Based on the evaluation function array dynamic optimization node scheduling queue, calculate the shortest distance in combination with shortest path fast algorithm;Iterative processing all shortest path query requests and return query result.The present application can effectively process the directed graph containing negative weight edge but not containing negative weight ring, and is suitable for large-scale network environment under traffic road network map efficient shortest path calculation.

The application discloses a photovoltaic array maximum power point tracking method and system based on a quantum marine predator-disturbance observation fusion algorithm, and specifically is as follows: on the basis of marine predator optimization, the duty cycle of a front-stage DC-DC converter is taken as a to-be-optimized control variable, candidate duty cycles are normalized and mapped into rotation angle parameters of a parameterized quantum circuit, quantum state coding, quantum gate operation and measurement sampling are performed under a quantum computing framework, and position updating of the marine predator algorithm is corrected according to measurement results, so that global optimization of quantum computing is realized; when a search solution enters a maximum power point neighborhood, a disturbance observation method is switched to for local fine tracking; and when environmental mutation or output power deviation exceeding a threshold is detected, quantum global search is restarted. The application improves the search ability for a global maximum power point under the condition of local shadow and multi-peak power curve, has fast algorithm convergence speed, strong steady-state operation performance and a wide application range.

This invention discloses a fast algorithm for solving two-dimensional nonlinear steady-state temperature fields using an improved domain decomposition method. This algorithm divides the solution domain into multiple non-overlapping sub-regions, enabling parallel computation of the nonlinear physical field distribution in each sub-region, thus avoiding the need to construct and store large global matrices in traditional finite element methods. Compared to overlapping domain decomposition methods, this invention simplifies the sub-domain partitioning process and only considers the sub-domain boundary nodes as overlapping parts, reducing the computational scale. Compared to non-overlapping domain decomposition methods, this invention relies on Dirichlet boundary condition interaction information, resulting in faster iterative convergence. This invention uses the improved domain decomposition method to solve the finite element model of the nonlinear steady-state temperature field. The steady-state temperature field distribution in each sub-region can be computed in parallel using the multi-threaded processor of the computing platform. Compared to finite element software, this invention can improve the computational speed for solving the nonlinear steady-state temperature field distribution of a contactor by up to 3.38 times.

The application discloses a high-precision ADC linearity test method and system, comprising the following steps: inputting a plurality of signal differences to an ADC through a control signal generator, a voltage source, an operator and a channel of a multiplexer, and obtaining a group of output code bits of each signal difference; summing and subtracting two preset signal differences, and summing and subtracting the output code bits of the two preset signal differences, to obtain summing and subtracting results; determining a multivariate linear equation group according to a preset segmented nonlinear model containing a parameter to be solved, the summing and subtracting results and the output code bits; obtaining an optimal solution by solving the equation group, and determining integral nonlinear errors and differential nonlinear errors of the ADC according to the optimal solution and the preset segmented nonlinear model. The application can calculate common-mode and differential-mode of integral nonlinearity and differential nonlinearity, can reduce the precision requirement of an input signal, can greatly shorten test time and sampling points, and has simple system structure, fast algorithm running speed and wide application prospect.

This invention relates to the field of capacitance calculation technology and discloses a fast algorithm for extracting parasitic capacitance in large-scale integrated circuits. This method combines the method of moments (MoM), a fast multipole algorithm for layered dielectrics, and overlapping region decomposition preprocessing techniques to construct a complete parasitic capacitance extraction solution. By directly introducing the Green's function for the layered dielectric, the numerical solution strictly satisfies the electric field transport conditions at the dielectric interface, and the electrostatic problem in the layered dielectric is transformed into boundary integral equations defined on the interconnect surface. Subsequently, the MoM is used to discretize these boundary integral equations, resulting in a large-scale dense system of linear algebraic equations. To improve solution efficiency, an efficient preprocessing strategy based on overlapping region decomposition is further designed, and combined with the matrix-free minimum residual iteration method and the layered fast multipole algorithm, achieving efficient solution with low computational and storage overhead.