Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

277 results about "Conjugate gradient method" patented technology

In mathematics, the conjugate gradient method is an algorithm for the numerical solution of particular systems of linear equations, namely those whose matrix is symmetric and positive-definite. The conjugate gradient method is often implemented as an iterative algorithm, applicable to sparse systems that are too large to be handled by a direct implementation or other direct methods such as the Cholesky decomposition. Large sparse systems often arise when numerically solving partial differential equations or optimization problems.

Image type fire flame identification method

The invention discloses an image type fire flame identification method. The method comprises the following steps of 1, image capturing; 2, image processing. The image processing comprises the steps of 201, image preprocessing; 202, fire identifying. The fire identifying comprises the steps that indentifying is conducted by the adoption of a prebuilt binary classification model, the binary classification model is a support vector machine model for classifying the flame situation and the non-flame situation, wherein the building process of the binary classification model comprises the steps of I, image information capturing;II, feature extracting; III, training sample acquiring; IV, binary classification model building; IV-1, kernel function selecting; IV-2, classification function determining, optimizing parameter C and parameter D by the adoption of the conjugate gradient method, converting the optimized parameter C and parameter D into gamma and sigma 2; V, binary classification model training. By means of the image type fire flame identification method, steps are simple, operation is simple and convenient, reliability is high, using effect is good, and the problems that reliability is lower, false or missing alarm rate is higher, using effect is poor and the like in an existing video fire detecting system under a complex environment are solved effectively.
Owner:东开数科(山东)产业园有限公司

Gaussian process regression-based method for predicting state of health (SOH) of lithium batteries

The invention discloses a Gaussian process regression-based method for predicting state of health (SOH) of lithium batteries, relates to a method for predicting the SOH of the lithium batteries, belongs to the fields of electrochemistry and analytic chemistry and aims at the problem that the traditional lithium batteries are bad in health condition prediction adaptability. The method provided by the invention is realized according to the following steps of: I. drawing a relation curve of the SOH of a lithium battery and a charge-discharge period; II, selecting a covariance function according to a degenerated curve with a regeneration phenomenon and a constraint condition; III, carrying out iteration according to a conjugate gradient method, then determining the optimal value of a hyper-parameter and bringing initial value thereof into prior distribution; IV, obtaining posterior distribution according to the prior part; V, obtaining the mean value and variance of predicted output f' without Gaussian white noise; and VI, together bringing the practically predicted SOH of the battery and the predicted SOH obtained in the step V into training data y to obtain the f', then determining the prediction confidence interval and predicting the SOH of the lithium battery. The method provided by the invention is used for detecting lithium batteries.
Owner:HARBIN INST OF TECH

Power system short-term load probability forecasting method, device and system

The invention discloses a power system short-term load probability forecasting method, a device and a system. The short-term load probability density forecasting model of Gaussian process quantile regression is established by selecting an optimal input variable set affecting the load. Firstly, the importance score of input variables is given by stochastic forest algorithm, and the influence degreeof each input variable is sorted. Secondly, particle swarm optimization algorithm is used to search the super-parameters of the model to form the optimal Gaussian process quantile regression prediction model, avoiding the adverse effect of artificial experience setting initial parameters on the prediction performance of the model. The invention can avoid the shortcomings of manual experience selection, the load forecasting model established in the optimal input variable set has low error, which further reduces the forecasting error, and overcomes the problems that the common conjugate gradient method is easy to fall into the local optimal solution, the iterative number is difficult to determine, and the optimization performance is greatly affected by the initial value selection, so that the self-searching and group cognitive ability can be brought into full play.
Owner:ELECTRIC POWER RESEARCH INSTITUTE OF STATE GRID SHANDONG ELECTRIC POWER COMPANY +2

Method for increasing computing speed through parallel computing based on MPI and OpenMP hybrid programming model

The invention discloses a method for increasing the computing speed through parallel computing based on an MPI and OpenMP hybrid programming model. The method includes the steps that the callable MPI process number and OpenMP thread number are determined according to the computing node number and the available CPU core number in nodes; an existing sub sparse matrix A, the sub initial vector x0, the block vector b and the maximum computing tolerance Tolerance are read into each process; a multi-thread compiling command is enabled for each process; cycle computing of a precondition conjugate gradient method is conducted on all the processes; if the computed error is smaller than the permissible value, cycle computing is ended, and otherwise, cycle computing is continuously conducted; computing results of all the processes are reduced, and a solution of a problem is output; when parallel computing is conducted, MPI processes are started, multi-thread resolving is conducted on the problem, parallel computing among the nodes is started, all the MPI processes are distributed to one computing node, and information is exchanged through message transmission among the processes; then in all the MPT processes, an OpenMP guidance command is used to create a set of threads, and the threads are distributed to different processors of the computing node to be executed.
Owner:INST OF SOFTWARE APPL TECH GUANGZHOU & CHINESE ACAD OF SCI

Method and apparatus for efficient training of support vector machines

The present invention provides a system and method for building fast and efficient support vector classifiers for large data classification problems which is useful for classifying pages from the World Wide Web and other problems with sparse matrices and large numbers of documents. The method takes advantage of the least squares nature of such problems, employs exact line search in its iterative process and makes use of a conjugate gradient method appropriate to the problem. In one embodiment a support vector classifier useful for classifying a plurality of documents, including textual documents, is built by selecting a plurality of training documents, each training document having suitable numeric attributes which are associated with a training document vector, then initializing a classifier weight vector and a classifier intercept for a classifier boundary, the classifier boundary separating at least two document classes, then determining which training document vectors are suitable support vectors, and then re-computing the classifier weight vector and the classifier intercept for the classifier boundary using the suitable support vectors together with an iteratively reindexed least squares method and a conjugate gradient method with a stopping criterion.
Owner:R2 SOLUTIONS

Non-linear conjugate gradient three-dimensional inversion method of magnetotelluric field

The invention discloses a non-linear conjugate gradient three-dimensional inversion method of a magnetotelluric field, which comprises the following steps of: a, establishing a three-dimensional model, and determining model parameters; b, acquiring impedance response through the model resistivity by using the staggered-grid finite difference of the magnetotelluric field as a forward modeling method; c, comparing the impedance which is acquired by forward modeling with an actually measured impedance to acquire an impedance data deviation; d, judging whether a target function value is enough small or not, finishing iteration when the target function value is small enough, otherwise entering the next step; e, calculating the gradient of a target function, and acquiring a search step-length and a search direction by using a non-linear conjugate gradient method as an inversion method so as to calculate a model modifier, wherein the resistivity calculated by using the impedance data error and current iteration is used as a preprocessing factor in the inversion method; and f, modifying the model, and returning to the step b. The non-linear conjugate gradient three-dimensional inversion method of the magnetotelluric field has the characteristics of high efficiency and high accuracy.
Owner:INST OF MINERAL RESOURCES CHINESE ACAD OF GEOLOGICAL SCI

Magnetic resonance and transient electromagnetic spatial constraint joint inversion method

ActiveCN104537714AImplement smooth continuous constraintsSolve the problem of non-uniqueness3D modellingLayer thicknessConjugate gradient method
The invention relates to a high-precision magnetic resonance and transient electromagnetic spatial constraint joint inversion method. The joint inversion method is based on a forward modeling method combining a continued fraction expansion numerical integration equivalent transformation method and a digital filtering method. The magnetic field calculation precision and speed are both taken into account, an original model and a simplest model are provided, a rotary coefficient matrix equation is designed, and exciting field distribution is simulated and detected when different slope dip angles appear and profile angles change. According to a forward modeling result obtained under the condition of changed dip angle parameters, the forward modeling result is combined with a hierarchical full collection data inversion method, a joint inversion objective function, an iterative equation and a three-dimensional ground model are constructed, a prior information constraint matrix, a roughness matrix, a layer thickness constraint matrix and other spatial constraint matrices are introduced to construct an inversion iterative equation set, based on a large scale matrix of a preconditioning conjugate gradient method, smooth and continuous constraint for the specific resistance, the layer thickness, the water content and the relaxation time is achieved, the problem of inversion non-uniqueness is solved, and the problem that optimization and calculation of a large-scale matrix for spatial constraint inversion involves mass data is solved.
Owner:JILIN UNIV

Method for increasing calculation speed of SMP cluster system through MPI and OpenMP in hybrid parallel mode

The invention discloses a method for increasing the calculation speed of an SMP cluster system through an MPI and an OpenMP in a hybrid parallel mode. The method comprises the steps that the number of MPI processes which can be called and the number of OpenMP threads are determined according to the number of calculation nodes and the number of usable CPU kernels in the nodes; an existing sub sparse matrix, a sub initial vector, a block vector and the maximum calculation tolerance are read in each process; a multi-thread compiling instruction is started for each process; circulation calculation of a precondition conjugate gradient method is conducted on all the processes, and the number of OpenMP barriers in circulation calculation is only three; if calculation errors are smaller than an allowable value, circulation is over, and otherwise circulation continues; calculation results of all the processes are reduced, and solutions of questions are output; when parallel calculation is conducted, firstly, MPI processes are started, multi-process decomposition is conducted on the questions, parallel among the nodes is started, each MPI process is allocated to one calculation node, and information is exchanged between the processes trough message transmission; then, in each MPI process, OpenMP guidance instructions are used for establishing one set of threads, and the threads are allocated to different processors of the calculation nodes to conduct parallel execution.
Owner:INST OF SOFTWARE APPL TECH GUANGZHOU & CHINESE ACAD OF SCI

Composite reconstruction method for self-adaptation quantitative magnetisability distribution diagram based on structural feature

The invention provides a composite reconstruction method for a self-adaptation quantitative magnetisability distribution diagram based on the structural feature, and relates to quantitative magnetisability imaging. According to the priori magnetisability distribution diagram base reconstruction based on the amplitude image structural feature, a reconstruction model comprises a fidelity item with a compression perception characteristic and an amplitude priori regularization bound item with a sparse feature, a region of interest is added to extract a binary weighting matrix from an amplitude image, and binary weighting is conducted on original magnetisability distribution; according to magnetisability distribution diagram composite reconstruction based on the magnetisability distribution structural feature, the reconstruction model comprises a least square fidelity item, a structural feature regularization bound item, acquired by base reconstruction, of a magnetisability distribution diagram structure, and a smooth item used for improving a reconstruction magnetisability distribution effect, the magnetisability structural feature is defined as the ladder degree information of 3D image data in three directions in a priori mode; for a l1 norm optimization problem, an iterative threshold value method is used for processing; then, based on the convex function character of a l2 norm, a conjugate gradient method is used for solving.
Owner:XIAMEN UNIV

A Method for Inkjet Printing Texture Image Registration Based on Cell Decomposition Optical Flow Field

ActiveCN102262781AReduce bias defectsAvoid difficultiesImage analysisPattern recognitionIncomplete Cholesky factorization
The invention relates to a method for the registration of an ink-jet printing texture image based on a unit decomposition optical flow field. The method comprises the following steps of: 1, inputting a reference image and a distorted image and setting iteration implementation parameters; 2, performing incomplete Cholesky decomposition on a coefficient matrix of a registration displacement vector;3, taking a primary function as a linear primary function, and solving a unit decomposition coefficient column vector by a preconditioned conjugate gradient method according to an iteration error value; 4, calculating an overall error estimation value, and adjusting a scale space to obtain a rough scale space; 5, taking the primary function as a second order primary function, and solving the unitdecomposition coefficient column vector on the rough scale space according to a local error estimation result to obtain a fine scale space; and 6, stacking and expanding the unit decomposition coefficient column vector on the fine scale space to obtain the registration displacement vector and complete registration. By the method, the registration representation capability of a feature texture curve can be effectively improved, the registration precision in noise environment is improved, and the registration speed in noise environment is increased. Therefore, the method is applicable for the registration of the ink-jet printing texture image.
Owner:ZHEJIANG UNIV OF TECH

Method and apparatus for efficient training of support vector machines

The present invention provides a system and method for building fast and efficient support vector classifiers for large data classification problems which is useful for classifying pages from the World Wide Web and other problems with sparse matrices and large numbers of documents. The method takes advantage of the least squares nature of such problems, employs exact line search in its iterative process and makes use of a conjugate gradient method appropriate to the problem. In one embodiment a support vector classifier useful for classifying a plurality of documents, including textual documents, is built by selecting a plurality of training documents, each training document having suitable numeric attributes which are associated with a training document vector, then initializing a classifier weight vector and a classifier intercept for a classifier boundary, the classifier boundary separating at least two document classes, then determining which training document vectors are suitable support vectors, and then re-computing the classifier weight vector and the classifier intercept for the classifier boundary using the suitable support vectors together with an iteratively reindexed least squares method and a conjugate gradient method with a stopping criterion.
Owner:R2 SOLUTIONS

Overall FPGA automated layout method based on analytical method

Disclosed is an overall FPGA automated layout method based on an analytical method. The layout method comprises the steps that S1, constraint information and circuit netlist information are packed andinput through mapping; S2, time delay information of user constraints is input through a static time delay analyzer; S3, each circuit unit module is automatically laid out in corresponding positionsin a physical design of a chip according to physical constraints designated by a user, and an input and output layout, a global clock layout, an initial layout, an overall layout, a legitimation layout and a detailed layout are involved; according to the overall layout, a conjugate gradient method based on a mixed step-length adjustment strategy is adopted for solving according to the initial positions of the circuit unit modules and circuit topological connection, a step-length calculation manner is dynamically adjusted aiming at the circuit unit modules of different levels and layout states,and the circuit unit modules are distributed; S4, the circuit netlist information is output. By means of the layout method, rapid automated layout is conducted on a chip layout, so that the line length and time delay of a network meet the user constraints; by adjusting a step-length optimization strategy of the overall layout, the quality and speed of the layout are optimized.
Owner:SHANGHAI FUDAN MICROELECTRONICS GROUP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products