18 results about "Coefficient matrix" patented technology

In order to overcome the problem that the current technology is difficult to estimate and continuously correct the bridge twin model by obtaining a series of test and test data, the application provides a bridge twin dynamic model Fourier modeling method based on test data, which is only related to the parameters of the bridge according to the system matrix related to all nodes of the bridge and the observation coefficient matrix related to all nodes, and the first continuous test process of the bridge does not change greatly, and the first comprehensive detection of the bridge twin dynamic mathematical model and the subsequent each time of the bridge twin dynamic mathematical model comprehensive correction process is relatively short, according to the characteristics of the fast and slow change matrix, the slow change matrix is set as a constant matrix in the first continuous test, and the system matrix related to all nodes of the bridge and the observation coefficient matrix related to all nodes in the bridge twin model are established through a series of effective tests and optimal indexes, and the bridge twin model is continuously corrected in the whole life cycle of the bridge, so that the technical problem of estimating and improving the bridge vibration model by obtaining a series of test and test data is solved.

The application discloses a multi-unmanned aerial vehicle control method based on reinforcement learning and belongs to the technical field of unmanned aerial vehicle cooperative control. The application designs a control algorithm for a double-time-scale multi-agent, effectively avoids possible calculation errors in the process of solving a matrix equation by introducing a novel coefficient matrix, and proposes a hybrid iteration algorithm which is independent of initial stable controller gain and has a fast convergence speed and is used for solving an approximate solution of a game algebraic Riccati equation based on a communication topology between agents. The application can realize consistency between unmanned aerial vehicles, enables the unmanned aerial vehicles to work cooperatively, and completes a task.

The application belongs to the technical field of robot dynamics parameter identification, and discloses a double sparse efficient identification method and system for robot dynamics parameters. The method comprises the following steps: S1, collecting joint positions, joint speeds, joint torques and joint accelerations of a robot to be processed at each time; S2, constructing an implicit dynamics equation of the joint torque by taking the joint torque as a target; S3, constructing a base function database, evaluating the importance of each base function in the base function database, thereby completing the first sparse of the base function; and performing sparsification on the coefficient matrix to make some elements in the coefficient matrix 0, thereby completing the second sparse of the base function, determining the base function and the coefficient matrix, and realizing the acquisition of an explicit dynamics equation of the joint torque. Through the application, the technical problems of complex theoretical modeling or low interpretability of a black box model in the prior art are solved.

This invention discloses an advanced positioning algorithm that, by constructing a statically indeterminate linear equation system, can efficiently integrate data from various stations in a large-scale distributed positioning system and accurately determine the target location in a single calculation. Its innovation lies in utilizing the transformation relationship between polar and rectangular coordinate systems to directly construct a boundary value equation containing mixed variables based on the path difference equation. Through appropriate equation transformation and variable substitution, the algorithm achieves linearization of the boundary value equation, significantly simplifying the calculation process. Furthermore, addressing the decisive influence of the path difference construction method or matrix construction strategy on positioning accuracy, this invention proposes unique path difference construction rules or coefficient matrix construction methods. These rules and methods ensure highly accurate positioning results in practical applications. The new algorithm is not only simple but also significantly improves positioning efficiency, bringing a revolutionary change to large-scale distributed positioning.

This application discloses a two-dimensional DC electric field forward modeling method, apparatus, electronic device, dielectric, and product. The method includes: taking the variational problem of a two-dimensional wavenumber domain point source DC electric field as the research object; dividing the model region of the dielectric model into several triangular elements and expanding the model region with a sparse mesh; reading the conductivity and potential of the principal nodes in each triangular element, and representing the conductivity and potential with quadratic interpolation shape functions to obtain a discrete model; constructing a system of linear equations based on the discrete model and the coefficient matrix of each triangular element; solving the system of linear equations to obtain the wavenumber domain forward modeling result; and performing an inverse Fourier transform on the forward modeling result to obtain the spatial domain electric field potential. The method increases the number of nodes in the mesh during model region meshing, reduces computation time by expanding the model, and utilizes more node property information through biquadratic interpolation of conductivity and potential within the mesh, thereby improving the accuracy of the two-dimensional DC electric field forward modeling fitting.

The application particularly relates to a linear equation set solving method for semiconductor device simulation, which comprises the following steps: determining a target linear equation set, and performing nested partitioning and reordering on a coefficient matrix of the target linear equation set to obtain a transformed coefficient matrix and a corresponding right end vector; based on a preset decomposition precision, the transformed coefficient matrix is decomposed through a selected main element LU decomposition, a forward substitution algorithm and a back substitution algorithm to obtain a current solution vector, and based on a preset working precision, when an initial residual vector does not satisfy a preset solving condition, a modified vector is obtained through a preconditioned GMRES algorithm; based on the preset working precision, the current solution vector and the modified vector, an updated solution vector is obtained as a current solution vector, and a step of calculating a residual vector is re-executed until a latest residual vector after iteration satisfies the preset solving condition, and a final solution is obtained based on the latest current solution vector. Thus, the problems of low solving precision and slow speed in semiconductor device simulation are solved.

A task processing method and apparatus are disclosed. The method includes: acquiring the coefficient matrix of a linear equation system corresponding to grid data, wherein the grid data includes multiple grid point data, and the values ​​in the coefficient matrix represent the relationship between each grid point data and other grid point data; the multiple grid point data are divided into N sub-grid data according to a first partitioning method, and the N sub-grid data correspond to N first sub-matrices in the coefficient matrix; determining whether the N first sub-matrices obtained according to the first partitioning method are suitable for a solver to perform a solution operation on the linear equation system based on the relationship between the grid point data in each of the N sub-matrices; when it is determined that the N first sub-matrices obtained according to the first partitioning method are not suitable for the solver to perform a solution operation, determining N second sub-matrices obtained by partitioning the grid data according to a second partitioning method; and performing a solution operation on the N second sub-matrices using a solver.

The application discloses a coding and decoding method and device, an encryption method, a learning method and a chip, and relates to the technical field of data processing. The coding method comprises the following steps: constructing a linear equation set based on a preset key-value table, and obtaining a coefficient matrix of the linear equation set; solving a maximum linearly independent group of the coefficient matrix, and adding preset key-value pairs corresponding to rows except linearly independent rows in the maximum linearly independent group to a linear correlation set; updating the linear equation set based on the linear correlation set, and obtaining an encoding vector based on the updated linear equation set; and decoding a query key based on the encoding vector and the linear correlation set for the query key. The method can ensure successful encoding by setting the linear correlation set, and can reduce the storage cost, thereby saving the storage cost and improving the query efficiency.

A multi-time-layer differential scheme for implicit heat transfer calculation using moving particles is presented, with the following specific steps: 1. Before calculation, virtual particles are arranged at the boundary to implement boundary layout, using virtual particles to arrange the first, second, and third types of boundaries for heat transfer calculation, as well as symmetric and periodic geometric boundary conditions; 2. During heat transfer calculation, the physical and mathematical relationships between different particles are given according to the input boundary conditions; 3. The distances between particle i and its neighboring particle j from the boundary surface formed by the boundary particles are calculated, and boundary conditions are applied; 4. The particle properties are given according to the initial input temperature, and the calculation time step length is given according to the stability condition; 5. The coefficient matrix and source terms of the multi-time-layer scheme of the heat diffusion equations are combined to solve the energy equation for temperature; 6. A consistent solution is performed using relevant solving algorithms to solve for the next temperature and determine whether convergence has occurred; 7. After all MPS calculations for a single time step are completed, the next time step is initiated.

The application provides a numerical simulation method and device for a hypersonic flow field and an electronic device, including establishing a three-dimensional space discrete model based on a parabolic Navier-Stokes equation, arranging flow variables at the center of a control volume surface formed by adjacent sections along a main flow direction; introducing a pressure gradient splitting mechanism in the calculation of a flow direction flux, forming a flow direction inviscid Jacobian matrix by directional processing of the pressure gradient on the current section in combination with the relationship between the conservative variables and the grid geometric derivative; constructing a corresponding transverse inviscid Jacobian matrix and obtaining its spectral radius information, calculating a transverse viscous flux based on a central difference format, and constructing an implicit correction equation, splitting the lower triangular, upper triangular and diagonal parts of the coefficient matrix, solving a block diagonal system through forward scanning and backward scanning, obtaining variable increments of the next section and updating the flow parameters, and realizing numerical simulation of the hypersonic flow field.

This invention discloses a method for constructing a propeller wake tip vortex contraction model, comprising: acquiring propeller wake field data under given operating conditions and performing dimensionless processing on the spatial coordinates; identifying and locating tip vortex structures in the dimensionless wake field, and obtaining a tip vortex contraction trajectory dataset through axial tracking; fitting the trajectory data using a stretched exponential wake vortex contraction model to extract a set of contraction characteristic parameters; establishing a mapping relationship between the input characteristic parameters of the novel propeller and the set of novel propeller contraction characteristic parameters through a regression optimization method to obtain a coefficient matrix; and, for the novel propeller, combining its geometric data, operating parameters, and the coefficient matrix, outputting the tip vortex contraction curve using the stretched exponential wake vortex contraction model. This invention can accurately predict the tip vortex contraction law of different propellers, providing reliable model support for propeller wake field analysis, noise assessment, and optimization design.

The application discloses an optimization modal superposition stress reconstruction method based on time domain coupling solution, which comprises the following steps: 1) establishing a finite element model based on design data of a target structure, and constructing a basic modal database; 2) forming a stress monitoring numerical matrix and a modal information matrix; 3) dividing the stress monitoring numerical matrix by a sliding time window; 4) forming a standard quadratic convex optimization equation form by jointly solving a modal coefficient in the time window, and jointly solving a multi-time step modal coefficient matrix in each time window; 5) calculating a stress time history result in each time window; and 6) splicing the stress time history results in all time windows, and outputting a result. Compared with the MS method, the application avoids peak and valley weakening or loss, is more optimal in phase consistency, and improves a determination coefficient to above 0.98. The application converts an underdetermined and ill-conditioned problem into a convex quadratic optimization problem through three types of regularization constraints, and the number of modes is not limited by the number of measuring points, and the solution result is unique and stable.

A task processing method, apparatus and system. The method comprises: acquiring a coefficient matrix of a system of linear equations corresponding to mesh data, wherein the mesh data comprises a plurality of pieces of mesh point data, a numerical value in the coefficient matrix represents a relationship between each piece of mesh point data from among the plurality of pieces of mesh point data and the other pieces of mesh point data, the plurality of pieces of mesh point data are divided into N pieces of mesh sub-data on the basis of a first division manner, and the N pieces of mesh sub-data correspond to N first sub-matrices in the coefficient matrix; on the basis of the relationship between the pieces of mesh point data in each first sub-matrix from among the N sub-matrices, determining whether the N first sub-matrices obtained on the basis of the first division manner are suitable for the execution of a solving operation on the system of linear equations by a solver; when it is determined that the N first sub-matrices obtained on the basis of the first division manner are not suitable for the execution of a solving operation by the solver, determining N second sub-matrices obtained by means of dividing the mesh data on the basis of a second division manner; and using the solver to execute the solving operation on the N second sub-matrices.

This invention relates to an integral optimal control method and system for ship adaptive rudder track holding, belonging to the field of ship adaptive rudder track control technology. It is proposed to address the problems of low track tracking accuracy and poor performance in indirect track control, as well as yaw issues encountered by wind, waves, and currents during straight track tracking. Key technical points: Based on the ship's speed u0 and the target heading deviation ψ... r Update system matrix A; select accuracy and energy consumption balance parameter matrices, solve the ILQR Riccati equation to obtain the optimal control variance matrix; calculate the ILQR controller proportional differential coefficient matrix, and calculate the integral coefficient matrix according to the critical damping principle; set the noise variance matrix, solve the GESO Riccati equation to obtain the observation equation matrix; calculate the GESO observation gain, and calculate the observation integral gain matrix according to the critical damping principle; calculate the GESO state observation result x and the ILQG control law; repeat the above steps to control the ship to travel along the set straight track. This invention can effectively solve the yaw problem encountered by wind, waves and current interference when tracking a straight track, making the closed-loop system have good robust stability, while reducing the number of steering operations per unit time and reducing steering energy consumption; after extensive testing, it has advanced performance.

This application relates to an accelerated simulation method for coolant in heat exchangers. The method includes: discretizing geometric parameters into an unstructured three-dimensional mesh to obtain the heat exchanger spatial mesh; establishing a set of coupled linear equations for the coolant flow field based on the spatial relationships and material parameters between the main mesh element and neighboring mesh elements within a finite volume method discretization framework; storing the global equation set coefficient matrix of the coupled linear equations for the coolant flow field in an overcompressed format to construct a linear system; solving the global coefficient matrix using an efficient selected algebraic multigrid method; performing algebraic multigrid coarsening operations on the representative matrix of the global coefficient matrix to construct a blocky coarse-level matrix and a coarse-level linear system to accelerate the solution of the coolant flow field, obtaining the coolant velocity vector field and pressure field. This method can improve the efficiency of solving the coolant flow field.

The invention provides a sparse triangular decoupling parallel acceleration method and system for a large-scale sparse linear equation set in chip simulation, and the method comprises the steps: firstly constructing a directed dependency graph based on a non-zero structure, and completing the segmentation of an initial task; recursively applying nested subdivision to the sub-problems of which the scales exceed a preset threshold value; and meanwhile, a top-down greedy merging mechanism is introduced, and sub-problems with too small scales are aggregated. The generated sub-problems are completely decoupled and can be executed independently and parallelly, and the maximum sub-problem scale is far smaller than that of the original problem. In addition, all dependency analysis results and task division schemes can be reused across right-end terms, on the premise that the non-zero structure of the coefficient matrix is kept unchanged, one-time preprocessing can support any multiple solving tasks, and preprocessing overhead is obviously reduced. According to the scheme, on the basis that the solving precision of a direct method is completely reserved, the parallel computing potential of the multi-core processor is fully released, and the high-throughput and low-delay linear equation set solving capacity is provided for super-large-scale chip simulation.